java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:54:55,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:54:55,042 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:54:55,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:54:55,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:54:55,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:54:55,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:54:55,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:54:55,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:54:55,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:54:55,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:54:55,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:54:55,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:54:55,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:54:55,083 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:54:55,084 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:54:55,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:54:55,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:54:55,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:54:55,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:54:55,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:54:55,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:54:55,107 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:54:55,107 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:54:55,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:54:55,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:54:55,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:54:55,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:54:55,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:54:55,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:54:55,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:54:55,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:54:55,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:54:55,119 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:54:55,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:54:55,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:54:55,122 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:54:55,148 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:54:55,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:54:55,149 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:54:55,149 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:54:55,150 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:54:55,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:54:55,150 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:54:55,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:54:55,150 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:54:55,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:54:55,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:54:55,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:54:55,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:54:55,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:54:55,155 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:54:55,155 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:54:55,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:54:55,156 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:54:55,156 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:54:55,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:54:55,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:54:55,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:54:55,158 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:54:55,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:54:55,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:55,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:54:55,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:54:55,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:54:55,159 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:54:55,159 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:54:55,160 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:54:55,160 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:54:55,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:54:55,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:54:55,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:54:55,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:54:55,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:54:55,240 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:54:55,241 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i [2018-11-23 09:54:55,307 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc7b4691/4825b65ee7f3416aab2875a210a804ec/FLAGd42abc60b [2018-11-23 09:54:55,769 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:54:55,769 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i [2018-11-23 09:54:55,775 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc7b4691/4825b65ee7f3416aab2875a210a804ec/FLAGd42abc60b [2018-11-23 09:54:56,147 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc7b4691/4825b65ee7f3416aab2875a210a804ec [2018-11-23 09:54:56,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:54:56,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:54:56,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:54:56,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:54:56,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b9643c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56, skipping insertion in model container [2018-11-23 09:54:56,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:54:56,197 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:54:56,417 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,422 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:54:56,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,476 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:54:56,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56 WrapperNode [2018-11-23 09:54:56,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:54:56,478 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:54:56,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:54:56,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:54:56,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:54:56,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:54:56,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:54:56,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:54:56,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:54:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:54:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:54:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:54:56,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:54:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:54:56,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:54:56,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:54:56,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:54:56,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:54:56,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:54:57,251 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:54:57,252 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 09:54:57,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57 BoogieIcfgContainer [2018-11-23 09:54:57,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:54:57,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:54:57,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:54:57,260 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:54:57,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:54:56" (1/3) ... [2018-11-23 09:54:57,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268e15f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (2/3) ... [2018-11-23 09:54:57,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268e15f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57" (3/3) ... [2018-11-23 09:54:57,267 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy1_false-unreach-call_ground.i [2018-11-23 09:54:57,278 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:54:57,292 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:54:57,313 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:54:57,349 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:54:57,350 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:54:57,350 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:54:57,350 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:54:57,350 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:54:57,350 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:54:57,351 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:54:57,352 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:54:57,352 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:54:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 09:54:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:54:57,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:57,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:57,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:57,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 09:54:57,389 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:57,390 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:54:57,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:57,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 09:54:57,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-23 09:54:57,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 09:54:57,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-23 09:54:57,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret8 := main(); {30#true} is VALID [2018-11-23 09:54:57,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {30#true} is VALID [2018-11-23 09:54:57,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 09:54:57,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} havoc ~i~0;~i~0 := 0bv32; {31#false} is VALID [2018-11-23 09:54:57,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !~bvslt32(~i~0, 100000bv32); {31#false} is VALID [2018-11-23 09:54:57,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} havoc ~x~0;~x~0 := 0bv32; {31#false} is VALID [2018-11-23 09:54:57,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {31#false} is VALID [2018-11-23 09:54:57,636 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 09:54:57,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 09:54:57,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 09:54:57,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 09:54:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:57,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:57,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:57,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:54:57,651 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 09:54:57,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:57,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:54:57,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:57,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:54:57,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:54:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:57,839 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 09:54:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,044 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 09:54:58,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:54:58,045 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 09:54:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 09:54:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 09:54:58,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-23 09:54:58,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,303 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:54:58,304 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 09:54:58,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 09:54:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 09:54:58,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:58,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 09:54:58,364 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 09:54:58,364 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 09:54:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,368 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 09:54:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 09:54:58,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,369 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 09:54:58,370 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 09:54:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,373 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 09:54:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 09:54:58,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:58,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 09:54:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 09:54:58,380 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 09:54:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:58,380 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 09:54:58,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:54:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 09:54:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:54:58,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:58,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:58,382 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:58,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:58,383 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 09:54:58,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:58,383 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:54:58,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:58,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-23 09:54:58,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {210#true} is VALID [2018-11-23 09:54:58,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-23 09:54:58,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #63#return; {210#true} is VALID [2018-11-23 09:54:58,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret8 := main(); {210#true} is VALID [2018-11-23 09:54:58,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {230#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:58,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {230#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {211#false} is VALID [2018-11-23 09:54:58,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {211#false} havoc ~i~0;~i~0 := 0bv32; {211#false} is VALID [2018-11-23 09:54:58,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {211#false} assume !~bvslt32(~i~0, 100000bv32); {211#false} is VALID [2018-11-23 09:54:58,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {211#false} havoc ~x~0;~x~0 := 0bv32; {211#false} is VALID [2018-11-23 09:54:58,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {211#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {211#false} is VALID [2018-11-23 09:54:58,513 INFO L256 TraceCheckUtils]: 11: Hoare triple {211#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {211#false} is VALID [2018-11-23 09:54:58,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2018-11-23 09:54:58,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {211#false} assume 0bv32 == ~cond; {211#false} is VALID [2018-11-23 09:54:58,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-23 09:54:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:58,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:58,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:58,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:54:58,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 09:54:58,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:58,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:54:58,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:54:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:54:58,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:58,586 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-23 09:54:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,870 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 09:54:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:54:58,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 09:54:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 09:54:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 09:54:58,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 09:54:59,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,139 INFO L225 Difference]: With dead ends: 38 [2018-11-23 09:54:59,140 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 09:54:59,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 09:54:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 09:54:59,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:59,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 09:54:59,159 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 09:54:59,159 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 09:54:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,162 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 09:54:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 09:54:59,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,163 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 09:54:59,164 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 09:54:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,166 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 09:54:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 09:54:59,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:59,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 09:54:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 09:54:59,170 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 09:54:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:59,170 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 09:54:59,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:54:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 09:54:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:54:59,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:59,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:59,172 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:59,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1578997828, now seen corresponding path program 1 times [2018-11-23 09:54:59,173 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:59,173 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:54:59,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:59,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-23 09:54:59,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {390#true} is VALID [2018-11-23 09:54:59,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-23 09:54:59,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #63#return; {390#true} is VALID [2018-11-23 09:54:59,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret8 := main(); {390#true} is VALID [2018-11-23 09:54:59,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {410#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {410#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {410#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {417#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:54:59,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {417#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {391#false} is VALID [2018-11-23 09:54:59,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#false} havoc ~i~0;~i~0 := 0bv32; {391#false} is VALID [2018-11-23 09:54:59,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#false} assume !~bvslt32(~i~0, 100000bv32); {391#false} is VALID [2018-11-23 09:54:59,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#false} havoc ~x~0;~x~0 := 0bv32; {391#false} is VALID [2018-11-23 09:54:59,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {391#false} is VALID [2018-11-23 09:54:59,350 INFO L256 TraceCheckUtils]: 13: Hoare triple {391#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {391#false} is VALID [2018-11-23 09:54:59,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2018-11-23 09:54:59,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume 0bv32 == ~cond; {391#false} is VALID [2018-11-23 09:54:59,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-23 09:54:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:59,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:54:59,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-23 09:54:59,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume 0bv32 == ~cond; {391#false} is VALID [2018-11-23 09:54:59,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2018-11-23 09:54:59,463 INFO L256 TraceCheckUtils]: 13: Hoare triple {391#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {391#false} is VALID [2018-11-23 09:54:59,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {391#false} is VALID [2018-11-23 09:54:59,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#false} havoc ~x~0;~x~0 := 0bv32; {391#false} is VALID [2018-11-23 09:54:59,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#false} assume !~bvslt32(~i~0, 100000bv32); {391#false} is VALID [2018-11-23 09:54:59,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#false} havoc ~i~0;~i~0 := 0bv32; {391#false} is VALID [2018-11-23 09:54:59,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {391#false} is VALID [2018-11-23 09:54:59,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {473#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {469#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:54:59,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {473#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:54:59,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {473#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:54:59,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret8 := main(); {390#true} is VALID [2018-11-23 09:54:59,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #63#return; {390#true} is VALID [2018-11-23 09:54:59,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-23 09:54:59,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {390#true} is VALID [2018-11-23 09:54:59,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-23 09:54:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:59,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:54:59,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:54:59,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 09:54:59,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:59,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:54:59,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:54:59,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:54:59,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:54:59,600 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 09:55:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,049 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 09:55:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:00,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 09:55:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 09:55:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 09:55:00,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2018-11-23 09:55:00,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,173 INFO L225 Difference]: With dead ends: 43 [2018-11-23 09:55:00,174 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 09:55:00,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:55:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 09:55:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 09:55:00,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:00,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 09:55:00,190 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 09:55:00,190 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 09:55:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,193 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 09:55:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 09:55:00,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,194 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 09:55:00,194 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 09:55:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,197 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 09:55:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 09:55:00,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 09:55:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-23 09:55:00,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2018-11-23 09:55:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,201 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-23 09:55:00,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 09:55:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 09:55:00,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,202 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:00,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1224789406, now seen corresponding path program 2 times [2018-11-23 09:55:00,204 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,204 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:00,222 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:00,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:55:00,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:00,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2018-11-23 09:55:00,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {659#true} is VALID [2018-11-23 09:55:00,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 09:55:00,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #63#return; {659#true} is VALID [2018-11-23 09:55:00,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret8 := main(); {659#true} is VALID [2018-11-23 09:55:00,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {659#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {659#true} is VALID [2018-11-23 09:55:00,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {659#true} is VALID [2018-11-23 09:55:00,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {659#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {659#true} is VALID [2018-11-23 09:55:00,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {659#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {659#true} is VALID [2018-11-23 09:55:00,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {659#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {659#true} is VALID [2018-11-23 09:55:00,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {659#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {659#true} is VALID [2018-11-23 09:55:00,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {659#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {659#true} is VALID [2018-11-23 09:55:00,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {659#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {659#true} is VALID [2018-11-23 09:55:00,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {659#true} is VALID [2018-11-23 09:55:00,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {659#true} assume !~bvslt32(~a~0, 100000bv32); {659#true} is VALID [2018-11-23 09:55:00,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {659#true} havoc ~i~0;~i~0 := 0bv32; {709#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {709#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {660#false} is VALID [2018-11-23 09:55:00,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {660#false} havoc ~x~0;~x~0 := 0bv32; {660#false} is VALID [2018-11-23 09:55:00,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {660#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {660#false} is VALID [2018-11-23 09:55:00,332 INFO L256 TraceCheckUtils]: 19: Hoare triple {660#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {660#false} is VALID [2018-11-23 09:55:00,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2018-11-23 09:55:00,332 INFO L273 TraceCheckUtils]: 21: Hoare triple {660#false} assume 0bv32 == ~cond; {660#false} is VALID [2018-11-23 09:55:00,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2018-11-23 09:55:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 09:55:00,334 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:00,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:00,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:55:00,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 09:55:00,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:00,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:55:00,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:55:00,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:55:00,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:00,477 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 3 states. [2018-11-23 09:55:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,642 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 09:55:00,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:55:00,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 09:55:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 09:55:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 09:55:00,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 09:55:00,755 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-23 09:55:00,758 INFO L225 Difference]: With dead ends: 42 [2018-11-23 09:55:00,758 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 09:55:00,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 09:55:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 09:55:00,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:00,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 09:55:00,776 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 09:55:00,776 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 09:55:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,778 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 09:55:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 09:55:00,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,779 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 09:55:00,780 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 09:55:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,782 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 09:55:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 09:55:00,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 09:55:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 09:55:00,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-23 09:55:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,786 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 09:55:00,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 09:55:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 09:55:00,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,787 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:00,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash 231531900, now seen corresponding path program 1 times [2018-11-23 09:55:00,788 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:00,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:00,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2018-11-23 09:55:00,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {895#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {895#true} is VALID [2018-11-23 09:55:00,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2018-11-23 09:55:00,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #63#return; {895#true} is VALID [2018-11-23 09:55:00,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret8 := main(); {895#true} is VALID [2018-11-23 09:55:00,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {895#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {915#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {915#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {915#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {915#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {922#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:00,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {922#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {922#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:00,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {922#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {929#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:00,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {929#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {929#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:00,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {929#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {936#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:00,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {936#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {936#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:00,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {936#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {943#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:00,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {896#false} is VALID [2018-11-23 09:55:00,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {896#false} havoc ~i~0;~i~0 := 0bv32; {896#false} is VALID [2018-11-23 09:55:00,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {896#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {896#false} is VALID [2018-11-23 09:55:00,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {896#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {896#false} is VALID [2018-11-23 09:55:00,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {896#false} assume !~bvslt32(~i~0, 100000bv32); {896#false} is VALID [2018-11-23 09:55:00,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {896#false} havoc ~x~0;~x~0 := 0bv32; {896#false} is VALID [2018-11-23 09:55:00,990 INFO L273 TraceCheckUtils]: 20: Hoare triple {896#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {896#false} is VALID [2018-11-23 09:55:00,990 INFO L256 TraceCheckUtils]: 21: Hoare triple {896#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {896#false} is VALID [2018-11-23 09:55:00,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {896#false} ~cond := #in~cond; {896#false} is VALID [2018-11-23 09:55:00,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {896#false} assume 0bv32 == ~cond; {896#false} is VALID [2018-11-23 09:55:00,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {896#false} assume !false; {896#false} is VALID [2018-11-23 09:55:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:55:00,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:01,225 INFO L273 TraceCheckUtils]: 24: Hoare triple {896#false} assume !false; {896#false} is VALID [2018-11-23 09:55:01,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {896#false} assume 0bv32 == ~cond; {896#false} is VALID [2018-11-23 09:55:01,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {896#false} ~cond := #in~cond; {896#false} is VALID [2018-11-23 09:55:01,226 INFO L256 TraceCheckUtils]: 21: Hoare triple {896#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {896#false} is VALID [2018-11-23 09:55:01,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {896#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {896#false} is VALID [2018-11-23 09:55:01,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {896#false} havoc ~x~0;~x~0 := 0bv32; {896#false} is VALID [2018-11-23 09:55:01,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {896#false} assume !~bvslt32(~i~0, 100000bv32); {896#false} is VALID [2018-11-23 09:55:01,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {896#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {896#false} is VALID [2018-11-23 09:55:01,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {896#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {896#false} is VALID [2018-11-23 09:55:01,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {896#false} havoc ~i~0;~i~0 := 0bv32; {896#false} is VALID [2018-11-23 09:55:01,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1007#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {896#false} is VALID [2018-11-23 09:55:01,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {1011#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1007#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:01,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {1011#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1011#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {1018#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1011#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {1018#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1018#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {1025#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1018#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {1025#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1025#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {1032#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1025#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {1032#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1032#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {895#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1032#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret8 := main(); {895#true} is VALID [2018-11-23 09:55:01,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #63#return; {895#true} is VALID [2018-11-23 09:55:01,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2018-11-23 09:55:01,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {895#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {895#true} is VALID [2018-11-23 09:55:01,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2018-11-23 09:55:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:55:01,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:01,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:55:01,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 09:55:01,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:01,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:55:01,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:55:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:55:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:55:01,374 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2018-11-23 09:55:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,462 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 09:55:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:55:02,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 09:55:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2018-11-23 09:55:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2018-11-23 09:55:02,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 64 transitions. [2018-11-23 09:55:02,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,589 INFO L225 Difference]: With dead ends: 57 [2018-11-23 09:55:02,589 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 09:55:02,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:55:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 09:55:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 09:55:02,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:02,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 09:55:02,637 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 09:55:02,638 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 09:55:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,640 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 09:55:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 09:55:02,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,642 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 09:55:02,642 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 09:55:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,644 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 09:55:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 09:55:02,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:02,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:55:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 09:55:02,648 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 25 [2018-11-23 09:55:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:02,649 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 09:55:02,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:55:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 09:55:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 09:55:02,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:02,650 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:02,651 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:02,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1451225264, now seen corresponding path program 2 times [2018-11-23 09:55:02,652 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:02,652 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:02,684 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:02,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:55:02,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:02,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1292#true} is VALID [2018-11-23 09:55:02,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {1292#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1292#true} is VALID [2018-11-23 09:55:02,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {1292#true} assume true; {1292#true} is VALID [2018-11-23 09:55:02,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1292#true} {1292#true} #63#return; {1292#true} is VALID [2018-11-23 09:55:02,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {1292#true} call #t~ret8 := main(); {1292#true} is VALID [2018-11-23 09:55:02,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {1292#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1312#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {1312#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1312#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {1312#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1319#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:02,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {1319#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1319#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:02,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {1319#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1326#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:02,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {1326#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1326#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:02,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {1326#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1333#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:02,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {1333#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1333#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:02,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {1333#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1340#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:02,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {1340#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1340#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:02,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {1340#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1347#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:02,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {1347#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1347#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:02,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {1347#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1354#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:02,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {1354#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1354#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:02,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {1354#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1361#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:02,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {1361#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1361#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:02,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {1361#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:02,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {1368#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1368#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:02,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {1368#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1375#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:02,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {1375#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1375#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:02,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {1375#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1382#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:02,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {1382#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1293#false} is VALID [2018-11-23 09:55:02,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {1293#false} havoc ~i~0;~i~0 := 0bv32; {1293#false} is VALID [2018-11-23 09:55:02,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {1293#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1293#false} is VALID [2018-11-23 09:55:02,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1293#false} is VALID [2018-11-23 09:55:02,993 INFO L273 TraceCheckUtils]: 30: Hoare triple {1293#false} assume !~bvslt32(~i~0, 100000bv32); {1293#false} is VALID [2018-11-23 09:55:02,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {1293#false} havoc ~x~0;~x~0 := 0bv32; {1293#false} is VALID [2018-11-23 09:55:02,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {1293#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1293#false} is VALID [2018-11-23 09:55:02,995 INFO L256 TraceCheckUtils]: 33: Hoare triple {1293#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {1293#false} is VALID [2018-11-23 09:55:02,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {1293#false} ~cond := #in~cond; {1293#false} is VALID [2018-11-23 09:55:02,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {1293#false} assume 0bv32 == ~cond; {1293#false} is VALID [2018-11-23 09:55:02,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {1293#false} assume !false; {1293#false} is VALID [2018-11-23 09:55:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:55:02,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:03,773 INFO L273 TraceCheckUtils]: 36: Hoare triple {1293#false} assume !false; {1293#false} is VALID [2018-11-23 09:55:03,773 INFO L273 TraceCheckUtils]: 35: Hoare triple {1293#false} assume 0bv32 == ~cond; {1293#false} is VALID [2018-11-23 09:55:03,773 INFO L273 TraceCheckUtils]: 34: Hoare triple {1293#false} ~cond := #in~cond; {1293#false} is VALID [2018-11-23 09:55:03,774 INFO L256 TraceCheckUtils]: 33: Hoare triple {1293#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {1293#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {1293#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1293#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {1293#false} havoc ~x~0;~x~0 := 0bv32; {1293#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {1293#false} assume !~bvslt32(~i~0, 100000bv32); {1293#false} is VALID [2018-11-23 09:55:03,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1293#false} is VALID [2018-11-23 09:55:03,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {1293#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1293#false} is VALID [2018-11-23 09:55:03,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {1293#false} havoc ~i~0;~i~0 := 0bv32; {1293#false} is VALID [2018-11-23 09:55:03,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1293#false} is VALID [2018-11-23 09:55:03,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1446#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:03,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {1450#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1450#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,785 INFO L273 TraceCheckUtils]: 23: Hoare triple {1457#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1450#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {1457#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1457#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {1464#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1457#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {1464#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1464#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {1471#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1464#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {1471#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1471#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {1478#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1471#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {1478#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1478#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {1485#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {1485#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1485#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {1492#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1485#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {1492#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1492#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {1499#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1492#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {1499#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1499#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,849 INFO L273 TraceCheckUtils]: 9: Hoare triple {1506#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1499#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {1506#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1506#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {1513#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1506#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {1513#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1513#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {1292#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1513#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {1292#true} call #t~ret8 := main(); {1292#true} is VALID [2018-11-23 09:55:03,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1292#true} {1292#true} #63#return; {1292#true} is VALID [2018-11-23 09:55:03,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {1292#true} assume true; {1292#true} is VALID [2018-11-23 09:55:03,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {1292#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1292#true} is VALID [2018-11-23 09:55:03,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1292#true} is VALID [2018-11-23 09:55:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:55:03,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:03,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:55:03,872 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-11-23 09:55:03,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:03,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:55:04,054 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-23 09:55:04,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:55:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:55:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:55:04,055 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 24 states. [2018-11-23 09:55:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:08,046 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2018-11-23 09:55:08,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:55:08,046 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-11-23 09:55:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 94 transitions. [2018-11-23 09:55:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 94 transitions. [2018-11-23 09:55:08,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 94 transitions. [2018-11-23 09:55:08,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:08,245 INFO L225 Difference]: With dead ends: 81 [2018-11-23 09:55:08,245 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 09:55:08,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 09:55:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 09:55:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 09:55:08,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:08,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 09:55:08,492 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 09:55:08,492 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 09:55:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:08,495 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 09:55:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 09:55:08,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:08,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:08,496 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 09:55:08,497 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 09:55:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:08,503 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 09:55:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 09:55:08,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:08,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:08,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:08,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 09:55:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-23 09:55:08,510 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 37 [2018-11-23 09:55:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:08,510 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 09:55:08,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:55:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 09:55:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 09:55:08,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:08,520 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:08,520 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:08,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1265204504, now seen corresponding path program 3 times [2018-11-23 09:55:08,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:08,552 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:55:08,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 09:55:08,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:08,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:08,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {1905#true} call ULTIMATE.init(); {1905#true} is VALID [2018-11-23 09:55:08,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {1905#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1905#true} is VALID [2018-11-23 09:55:08,843 INFO L273 TraceCheckUtils]: 2: Hoare triple {1905#true} assume true; {1905#true} is VALID [2018-11-23 09:55:08,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1905#true} {1905#true} #63#return; {1905#true} is VALID [2018-11-23 09:55:08,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {1905#true} call #t~ret8 := main(); {1905#true} is VALID [2018-11-23 09:55:08,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {1905#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1905#true} is VALID [2018-11-23 09:55:08,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,844 INFO L273 TraceCheckUtils]: 8: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,849 INFO L273 TraceCheckUtils]: 32: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,850 INFO L273 TraceCheckUtils]: 41: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,852 INFO L273 TraceCheckUtils]: 48: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:08,852 INFO L273 TraceCheckUtils]: 49: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:08,852 INFO L273 TraceCheckUtils]: 50: Hoare triple {1905#true} assume !~bvslt32(~a~0, 100000bv32); {1905#true} is VALID [2018-11-23 09:55:08,855 INFO L273 TraceCheckUtils]: 51: Hoare triple {1905#true} havoc ~i~0;~i~0 := 0bv32; {2063#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:08,858 INFO L273 TraceCheckUtils]: 52: Hoare triple {2063#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2063#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:08,858 INFO L273 TraceCheckUtils]: 53: Hoare triple {2063#(= main_~i~0 (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2070#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:08,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {2070#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1906#false} is VALID [2018-11-23 09:55:08,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {1906#false} havoc ~x~0;~x~0 := 0bv32; {1906#false} is VALID [2018-11-23 09:55:08,860 INFO L273 TraceCheckUtils]: 56: Hoare triple {1906#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1906#false} is VALID [2018-11-23 09:55:08,860 INFO L256 TraceCheckUtils]: 57: Hoare triple {1906#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {1906#false} is VALID [2018-11-23 09:55:08,860 INFO L273 TraceCheckUtils]: 58: Hoare triple {1906#false} ~cond := #in~cond; {1906#false} is VALID [2018-11-23 09:55:08,860 INFO L273 TraceCheckUtils]: 59: Hoare triple {1906#false} assume 0bv32 == ~cond; {1906#false} is VALID [2018-11-23 09:55:08,861 INFO L273 TraceCheckUtils]: 60: Hoare triple {1906#false} assume !false; {1906#false} is VALID [2018-11-23 09:55:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-23 09:55:08,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:09,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {1906#false} assume !false; {1906#false} is VALID [2018-11-23 09:55:09,022 INFO L273 TraceCheckUtils]: 59: Hoare triple {1906#false} assume 0bv32 == ~cond; {1906#false} is VALID [2018-11-23 09:55:09,022 INFO L273 TraceCheckUtils]: 58: Hoare triple {1906#false} ~cond := #in~cond; {1906#false} is VALID [2018-11-23 09:55:09,023 INFO L256 TraceCheckUtils]: 57: Hoare triple {1906#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {1906#false} is VALID [2018-11-23 09:55:09,023 INFO L273 TraceCheckUtils]: 56: Hoare triple {1906#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1906#false} is VALID [2018-11-23 09:55:09,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {1906#false} havoc ~x~0;~x~0 := 0bv32; {1906#false} is VALID [2018-11-23 09:55:09,024 INFO L273 TraceCheckUtils]: 54: Hoare triple {2110#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1906#false} is VALID [2018-11-23 09:55:09,024 INFO L273 TraceCheckUtils]: 53: Hoare triple {2114#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2110#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:09,024 INFO L273 TraceCheckUtils]: 52: Hoare triple {2114#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2114#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:09,025 INFO L273 TraceCheckUtils]: 51: Hoare triple {1905#true} havoc ~i~0;~i~0 := 0bv32; {2114#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:09,025 INFO L273 TraceCheckUtils]: 50: Hoare triple {1905#true} assume !~bvslt32(~a~0, 100000bv32); {1905#true} is VALID [2018-11-23 09:55:09,025 INFO L273 TraceCheckUtils]: 49: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,025 INFO L273 TraceCheckUtils]: 48: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,026 INFO L273 TraceCheckUtils]: 47: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,026 INFO L273 TraceCheckUtils]: 45: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,026 INFO L273 TraceCheckUtils]: 42: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,027 INFO L273 TraceCheckUtils]: 41: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,027 INFO L273 TraceCheckUtils]: 39: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,027 INFO L273 TraceCheckUtils]: 38: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,027 INFO L273 TraceCheckUtils]: 37: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,028 INFO L273 TraceCheckUtils]: 31: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,029 INFO L273 TraceCheckUtils]: 30: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,029 INFO L273 TraceCheckUtils]: 29: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,029 INFO L273 TraceCheckUtils]: 28: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {1905#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#true} is VALID [2018-11-23 09:55:09,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {1905#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1905#true} is VALID [2018-11-23 09:55:09,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {1905#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1905#true} is VALID [2018-11-23 09:55:09,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {1905#true} call #t~ret8 := main(); {1905#true} is VALID [2018-11-23 09:55:09,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1905#true} {1905#true} #63#return; {1905#true} is VALID [2018-11-23 09:55:09,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {1905#true} assume true; {1905#true} is VALID [2018-11-23 09:55:09,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {1905#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1905#true} is VALID [2018-11-23 09:55:09,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {1905#true} call ULTIMATE.init(); {1905#true} is VALID [2018-11-23 09:55:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-23 09:55:09,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:09,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:55:09,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-23 09:55:09,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:09,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:55:09,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:09,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:55:09,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:55:09,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:55:09,065 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 6 states. [2018-11-23 09:55:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,264 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-23 09:55:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:09,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-23 09:55:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-23 09:55:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-23 09:55:09,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2018-11-23 09:55:09,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:09,368 INFO L225 Difference]: With dead ends: 83 [2018-11-23 09:55:09,368 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 09:55:09,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:55:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 09:55:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 09:55:09,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:09,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 09:55:09,411 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 09:55:09,411 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 09:55:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,415 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 09:55:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 09:55:09,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:09,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:09,416 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 09:55:09,416 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 09:55:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,419 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 09:55:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 09:55:09,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:09,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:09,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:09,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 09:55:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-23 09:55:09,422 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 61 [2018-11-23 09:55:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:09,423 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-23 09:55:09,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 09:55:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 09:55:09,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:09,424 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:09,424 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:09,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:09,424 INFO L82 PathProgramCache]: Analyzing trace with hash -877321550, now seen corresponding path program 4 times [2018-11-23 09:55:09,425 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:09,425 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:09,451 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:55:09,562 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:55:09,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:09,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:10,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {2650#true} call ULTIMATE.init(); {2650#true} is VALID [2018-11-23 09:55:10,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {2650#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2650#true} is VALID [2018-11-23 09:55:10,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {2650#true} assume true; {2650#true} is VALID [2018-11-23 09:55:10,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2650#true} {2650#true} #63#return; {2650#true} is VALID [2018-11-23 09:55:10,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {2650#true} call #t~ret8 := main(); {2650#true} is VALID [2018-11-23 09:55:10,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {2650#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2670#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:10,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {2670#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2670#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:10,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {2670#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2677#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:10,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {2677#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2677#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:10,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {2677#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2684#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:10,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {2684#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2684#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:10,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {2684#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2691#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:10,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {2691#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2691#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:10,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {2691#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2698#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:10,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {2698#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2698#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:10,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {2698#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2705#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:10,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {2705#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2705#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:10,065 INFO L273 TraceCheckUtils]: 17: Hoare triple {2705#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2712#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:10,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {2712#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2712#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:10,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {2712#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2719#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:10,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {2719#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2719#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:10,067 INFO L273 TraceCheckUtils]: 21: Hoare triple {2719#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2726#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:10,067 INFO L273 TraceCheckUtils]: 22: Hoare triple {2726#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2726#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:10,068 INFO L273 TraceCheckUtils]: 23: Hoare triple {2726#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2733#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:10,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {2733#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2733#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:10,069 INFO L273 TraceCheckUtils]: 25: Hoare triple {2733#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2740#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:10,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {2740#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2740#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:10,071 INFO L273 TraceCheckUtils]: 27: Hoare triple {2740#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2747#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 09:55:10,079 INFO L273 TraceCheckUtils]: 28: Hoare triple {2747#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2747#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 09:55:10,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {2747#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2754#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 09:55:10,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {2754#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2754#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 09:55:10,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {2754#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 09:55:10,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {2761#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2761#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 09:55:10,093 INFO L273 TraceCheckUtils]: 33: Hoare triple {2761#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2768#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 09:55:10,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {2768#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2768#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 09:55:10,094 INFO L273 TraceCheckUtils]: 35: Hoare triple {2768#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2775#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 09:55:10,094 INFO L273 TraceCheckUtils]: 36: Hoare triple {2775#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2775#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 09:55:10,098 INFO L273 TraceCheckUtils]: 37: Hoare triple {2775#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2782#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 09:55:10,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {2782#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2782#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 09:55:10,099 INFO L273 TraceCheckUtils]: 39: Hoare triple {2782#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2789#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 09:55:10,099 INFO L273 TraceCheckUtils]: 40: Hoare triple {2789#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2789#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 09:55:10,100 INFO L273 TraceCheckUtils]: 41: Hoare triple {2789#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 09:55:10,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {2796#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2796#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 09:55:10,100 INFO L273 TraceCheckUtils]: 43: Hoare triple {2796#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2803#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 09:55:10,101 INFO L273 TraceCheckUtils]: 44: Hoare triple {2803#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2803#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 09:55:10,103 INFO L273 TraceCheckUtils]: 45: Hoare triple {2803#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2810#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 09:55:10,103 INFO L273 TraceCheckUtils]: 46: Hoare triple {2810#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2810#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 09:55:10,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {2810#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2817#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 09:55:10,104 INFO L273 TraceCheckUtils]: 48: Hoare triple {2817#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2817#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 09:55:10,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {2817#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2824#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 09:55:10,107 INFO L273 TraceCheckUtils]: 50: Hoare triple {2824#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {2651#false} is VALID [2018-11-23 09:55:10,107 INFO L273 TraceCheckUtils]: 51: Hoare triple {2651#false} havoc ~i~0;~i~0 := 0bv32; {2651#false} is VALID [2018-11-23 09:55:10,108 INFO L273 TraceCheckUtils]: 52: Hoare triple {2651#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#false} is VALID [2018-11-23 09:55:10,108 INFO L273 TraceCheckUtils]: 53: Hoare triple {2651#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2651#false} is VALID [2018-11-23 09:55:10,108 INFO L273 TraceCheckUtils]: 54: Hoare triple {2651#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#false} is VALID [2018-11-23 09:55:10,108 INFO L273 TraceCheckUtils]: 55: Hoare triple {2651#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2651#false} is VALID [2018-11-23 09:55:10,108 INFO L273 TraceCheckUtils]: 56: Hoare triple {2651#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#false} is VALID [2018-11-23 09:55:10,109 INFO L273 TraceCheckUtils]: 57: Hoare triple {2651#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2651#false} is VALID [2018-11-23 09:55:10,109 INFO L273 TraceCheckUtils]: 58: Hoare triple {2651#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#false} is VALID [2018-11-23 09:55:10,109 INFO L273 TraceCheckUtils]: 59: Hoare triple {2651#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2651#false} is VALID [2018-11-23 09:55:10,109 INFO L273 TraceCheckUtils]: 60: Hoare triple {2651#false} assume !~bvslt32(~i~0, 100000bv32); {2651#false} is VALID [2018-11-23 09:55:10,109 INFO L273 TraceCheckUtils]: 61: Hoare triple {2651#false} havoc ~x~0;~x~0 := 0bv32; {2651#false} is VALID [2018-11-23 09:55:10,110 INFO L273 TraceCheckUtils]: 62: Hoare triple {2651#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2651#false} is VALID [2018-11-23 09:55:10,110 INFO L256 TraceCheckUtils]: 63: Hoare triple {2651#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {2651#false} is VALID [2018-11-23 09:55:10,110 INFO L273 TraceCheckUtils]: 64: Hoare triple {2651#false} ~cond := #in~cond; {2651#false} is VALID [2018-11-23 09:55:10,110 INFO L273 TraceCheckUtils]: 65: Hoare triple {2651#false} assume 0bv32 == ~cond; {2651#false} is VALID [2018-11-23 09:55:10,110 INFO L273 TraceCheckUtils]: 66: Hoare triple {2651#false} assume !false; {2651#false} is VALID [2018-11-23 09:55:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 09:55:10,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:12,176 INFO L273 TraceCheckUtils]: 66: Hoare triple {2651#false} assume !false; {2651#false} is VALID [2018-11-23 09:55:12,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {2651#false} assume 0bv32 == ~cond; {2651#false} is VALID [2018-11-23 09:55:12,176 INFO L273 TraceCheckUtils]: 64: Hoare triple {2651#false} ~cond := #in~cond; {2651#false} is VALID [2018-11-23 09:55:12,177 INFO L256 TraceCheckUtils]: 63: Hoare triple {2651#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {2651#false} is VALID [2018-11-23 09:55:12,177 INFO L273 TraceCheckUtils]: 62: Hoare triple {2651#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2651#false} is VALID [2018-11-23 09:55:12,177 INFO L273 TraceCheckUtils]: 61: Hoare triple {2651#false} havoc ~x~0;~x~0 := 0bv32; {2651#false} is VALID [2018-11-23 09:55:12,177 INFO L273 TraceCheckUtils]: 60: Hoare triple {2651#false} assume !~bvslt32(~i~0, 100000bv32); {2651#false} is VALID [2018-11-23 09:55:12,178 INFO L273 TraceCheckUtils]: 59: Hoare triple {2651#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2651#false} is VALID [2018-11-23 09:55:12,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {2651#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#false} is VALID [2018-11-23 09:55:12,178 INFO L273 TraceCheckUtils]: 57: Hoare triple {2651#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2651#false} is VALID [2018-11-23 09:55:12,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {2651#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#false} is VALID [2018-11-23 09:55:12,178 INFO L273 TraceCheckUtils]: 55: Hoare triple {2651#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2651#false} is VALID [2018-11-23 09:55:12,179 INFO L273 TraceCheckUtils]: 54: Hoare triple {2651#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#false} is VALID [2018-11-23 09:55:12,179 INFO L273 TraceCheckUtils]: 53: Hoare triple {2651#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2651#false} is VALID [2018-11-23 09:55:12,179 INFO L273 TraceCheckUtils]: 52: Hoare triple {2651#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#false} is VALID [2018-11-23 09:55:12,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {2651#false} havoc ~i~0;~i~0 := 0bv32; {2651#false} is VALID [2018-11-23 09:55:12,179 INFO L273 TraceCheckUtils]: 50: Hoare triple {2924#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2651#false} is VALID [2018-11-23 09:55:12,180 INFO L273 TraceCheckUtils]: 49: Hoare triple {2928#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2924#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:12,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {2928#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2928#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,185 INFO L273 TraceCheckUtils]: 47: Hoare triple {2935#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2928#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,185 INFO L273 TraceCheckUtils]: 46: Hoare triple {2935#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2935#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,189 INFO L273 TraceCheckUtils]: 45: Hoare triple {2942#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2935#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {2942#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2942#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {2949#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2942#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {2949#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2949#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,202 INFO L273 TraceCheckUtils]: 41: Hoare triple {2956#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2949#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {2956#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2956#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,207 INFO L273 TraceCheckUtils]: 39: Hoare triple {2963#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2956#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {2963#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2963#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,214 INFO L273 TraceCheckUtils]: 37: Hoare triple {2970#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2963#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,214 INFO L273 TraceCheckUtils]: 36: Hoare triple {2970#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2970#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {2977#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,220 INFO L273 TraceCheckUtils]: 34: Hoare triple {2977#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2977#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {2984#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2977#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,224 INFO L273 TraceCheckUtils]: 32: Hoare triple {2984#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2984#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,230 INFO L273 TraceCheckUtils]: 31: Hoare triple {2991#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2984#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {2991#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2991#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,239 INFO L273 TraceCheckUtils]: 29: Hoare triple {2998#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2991#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {2998#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2998#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,249 INFO L273 TraceCheckUtils]: 27: Hoare triple {3005#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2998#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,249 INFO L273 TraceCheckUtils]: 26: Hoare triple {3005#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3005#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {3012#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3005#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {3012#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3012#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {3019#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3012#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {3019#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3019#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {3026#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3019#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {3026#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3026#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {3033#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3026#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {3033#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3033#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {3040#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3033#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {3040#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3040#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {3047#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3040#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {3047#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3047#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {3054#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3047#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {3054#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3054#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {3061#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3054#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {3061#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3061#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {3068#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3061#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {3068#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3068#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {3075#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3068#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {3075#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3075#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {2650#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3075#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:12,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {2650#true} call #t~ret8 := main(); {2650#true} is VALID [2018-11-23 09:55:12,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2650#true} {2650#true} #63#return; {2650#true} is VALID [2018-11-23 09:55:12,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {2650#true} assume true; {2650#true} is VALID [2018-11-23 09:55:12,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {2650#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2650#true} is VALID [2018-11-23 09:55:12,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {2650#true} call ULTIMATE.init(); {2650#true} is VALID [2018-11-23 09:55:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 09:55:12,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:12,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:55:12,373 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 67 [2018-11-23 09:55:12,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:12,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:55:12,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:12,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:55:12,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:55:12,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:55:12,674 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 48 states. [2018-11-23 09:55:21,793 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:55:22,288 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:55:22,831 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:55:23,368 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:55:23,978 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:55:24,689 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:55:25,303 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 09:55:25,925 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 09:55:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:32,745 INFO L93 Difference]: Finished difference Result 141 states and 168 transitions. [2018-11-23 09:55:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:55:32,746 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 67 [2018-11-23 09:55:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:55:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 154 transitions. [2018-11-23 09:55:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:55:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 154 transitions. [2018-11-23 09:55:32,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 154 transitions. [2018-11-23 09:55:33,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:33,117 INFO L225 Difference]: With dead ends: 141 [2018-11-23 09:55:33,117 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 09:55:33,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 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-23 09:55:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 09:55:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-23 09:55:33,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:33,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 120 states. [2018-11-23 09:55:33,183 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-23 09:55:33,183 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-23 09:55:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:33,189 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-11-23 09:55:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-11-23 09:55:33,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:33,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:33,190 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-23 09:55:33,190 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-23 09:55:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:33,194 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-11-23 09:55:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-11-23 09:55:33,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:33,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:33,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:33,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 09:55:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-11-23 09:55:33,201 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 67 [2018-11-23 09:55:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:33,201 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-11-23 09:55:33,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:55:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-11-23 09:55:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 09:55:33,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:33,203 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:33,203 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:33,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1140733826, now seen corresponding path program 5 times [2018-11-23 09:55:33,205 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:33,205 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:33,222 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1