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_two_index_03_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:13:19,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:13:19,119 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:13:19,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:13:19,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:13:19,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:13:19,139 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:13:19,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:13:19,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:13:19,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:13:19,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:13:19,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:13:19,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:13:19,155 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:13:19,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:13:19,160 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:13:19,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:13:19,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:13:19,170 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:13:19,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:13:19,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:13:19,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:13:19,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:13:19,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:13:19,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:13:19,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:13:19,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:13:19,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:13:19,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:13:19,181 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:13:19,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:13:19,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:13:19,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:13:19,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:13:19,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:13:19,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:13:19,186 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:13:19,211 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:13:19,211 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:13:19,212 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:13:19,212 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:13:19,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:13:19,213 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:13:19,213 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:13:19,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:13:19,214 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:13:19,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:13:19,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:13:19,214 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:13:19,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:13:19,215 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:13:19,215 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:13:19,215 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:13:19,215 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:13:19,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:13:19,215 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:13:19,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:13:19,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:13:19,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:13:19,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:13:19,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:13:19,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:19,217 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:13:19,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:13:19,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:13:19,217 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:13:19,218 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:13:19,218 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:13:19,218 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:13:19,218 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:13:19,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:13:19,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:13:19,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:13:19,293 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:13:19,294 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:13:19,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_03_true-unreach-call.i [2018-11-23 10:13:19,360 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed84125f6/df9775a3a8e04f4d98de225c78acb4b7/FLAG2d9ab8466 [2018-11-23 10:13:19,804 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:13:19,805 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_03_true-unreach-call.i [2018-11-23 10:13:19,811 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed84125f6/df9775a3a8e04f4d98de225c78acb4b7/FLAG2d9ab8466 [2018-11-23 10:13:20,190 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed84125f6/df9775a3a8e04f4d98de225c78acb4b7 [2018-11-23 10:13:20,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:13:20,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:13:20,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:20,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:13:20,209 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:13:20,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cbf194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20, skipping insertion in model container [2018-11-23 10:13:20,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:13:20,251 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:13:20,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:20,512 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:13:20,549 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:20,581 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:13:20,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20 WrapperNode [2018-11-23 10:13:20,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:20,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:20,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:13:20,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:13:20,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:20,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:13:20,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:13:20,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:13:20,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... [2018-11-23 10:13:20,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:13:20,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:13:20,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:13:20,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:13:20,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:13:20,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:13:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:13:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:13:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:13:20,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:13:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:13:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:13:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:13:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:13:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:13:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:13:21,335 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:13:21,335 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:13:21,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:21 BoogieIcfgContainer [2018-11-23 10:13:21,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:13:21,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:13:21,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:13:21,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:13:21,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:13:20" (1/3) ... [2018-11-23 10:13:21,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512a6115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:21, skipping insertion in model container [2018-11-23 10:13:21,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:20" (2/3) ... [2018-11-23 10:13:21,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512a6115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:21, skipping insertion in model container [2018-11-23 10:13:21,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:21" (3/3) ... [2018-11-23 10:13:21,345 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_03_true-unreach-call.i [2018-11-23 10:13:21,355 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:13:21,363 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:13:21,383 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:13:21,418 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:13:21,419 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:13:21,419 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:13:21,419 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:13:21,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:13:21,421 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:13:21,421 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:13:21,421 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:13:21,421 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:13:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 10:13:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:21,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:21,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:21,455 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:21,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 10:13:21,467 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:21,468 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:21,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:21,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:21,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 10:13:21,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 10:13:21,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 10:13:21,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 10:13:21,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 10:13:21,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {27#true} is VALID [2018-11-23 10:13:21,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 10:13:21,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 1bv32; {28#false} is VALID [2018-11-23 10:13:21,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !~bvslt32(~i~0, 10000bv32); {28#false} is VALID [2018-11-23 10:13:21,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 1bv32;~j~0 := 0bv32; {28#false} is VALID [2018-11-23 10:13:21,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {28#false} is VALID [2018-11-23 10:13:21,704 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 10:13:21,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 10:13:21,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 10:13:21,705 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 10:13:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:21,710 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:13:21,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:21,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:13:21,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:21,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:21,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:13:21,797 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 10:13:21,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:13:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:13:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:21,811 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 10:13:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:22,107 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 10:13:22,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:13:22,107 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:22,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 10:13:22,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:22,406 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:13:22,407 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:13:22,410 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 10:13:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:13:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:13:22,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:22,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:22,485 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:22,485 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:22,491 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:22,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:22,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:22,492 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:22,492 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:22,496 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:22,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:22,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:22,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:22,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:13:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 10:13:22,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 10:13:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:22,503 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 10:13:22,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:13:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:22,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:22,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:22,505 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:22,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:22,506 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 10:13:22,506 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:22,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:22,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:22,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 10:13:22,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {193#true} is VALID [2018-11-23 10:13:22,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 10:13:22,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} #60#return; {193#true} is VALID [2018-11-23 10:13:22,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {193#true} call #t~ret4 := main(); {193#true} is VALID [2018-11-23 10:13:22,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {213#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:22,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {194#false} is VALID [2018-11-23 10:13:22,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#false} ~i~0 := 1bv32; {194#false} is VALID [2018-11-23 10:13:22,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#false} assume !~bvslt32(~i~0, 10000bv32); {194#false} is VALID [2018-11-23 10:13:22,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~i~0 := 1bv32;~j~0 := 0bv32; {194#false} is VALID [2018-11-23 10:13:22,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {194#false} is VALID [2018-11-23 10:13:22,668 INFO L256 TraceCheckUtils]: 11: Hoare triple {194#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {194#false} is VALID [2018-11-23 10:13:22,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 10:13:22,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {194#false} assume 0bv32 == ~cond; {194#false} is VALID [2018-11-23 10:13:22,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 10:13:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:22,670 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:22,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:22,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:13:22,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:22,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:22,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:13:22,719 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 10:13:22,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:13:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:13:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:22,720 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 10:13:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:22,855 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 10:13:22,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:13:22,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:22,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 10:13:23,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:23,291 INFO L225 Difference]: With dead ends: 32 [2018-11-23 10:13:23,291 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:13:23,292 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 10:13:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:13:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:13:23,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:23,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:23,308 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:23,308 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:23,312 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:23,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:23,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:23,313 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:23,313 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:23,315 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:23,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:23,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:23,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:23,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:13:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:13:23,319 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 10:13:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:23,320 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:13:23,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:13:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:13:23,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:23,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:23,321 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:23,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2018-11-23 10:13:23,322 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:23,323 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:23,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:23,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:23,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:23,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:23,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:23,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:23,499 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:23,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {376#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:23,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:23,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {357#false} is VALID [2018-11-23 10:13:23,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:23,503 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 10000bv32); {357#false} is VALID [2018-11-23 10:13:23,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:23,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:23,504 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:23,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:23,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:23,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:23,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:23,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:23,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:23,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:23,728 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:23,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:23,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:23,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 10000bv32); {357#false} is VALID [2018-11-23 10:13:23,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:23,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {432#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {357#false} is VALID [2018-11-23 10:13:23,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {432#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:13:23,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:23,753 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:23,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:23,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:23,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:23,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:23,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:23,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:13:23,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:23,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:23,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:13:23,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:23,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:13:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:13:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:13:23,852 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 10:13:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:24,433 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 10:13:24,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:13:24,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:24,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 10:13:24,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:24,619 INFO L225 Difference]: With dead ends: 43 [2018-11-23 10:13:24,619 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 10:13:24,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:13:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 10:13:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-11-23 10:13:24,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:24,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:24,649 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:24,649 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:24,654 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:24,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:24,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:24,655 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:24,656 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:24,659 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:24,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:24,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:24,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:24,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:13:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 10:13:24,663 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-23 10:13:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:24,663 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 10:13:24,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:13:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 10:13:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:13:24,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:24,664 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:24,665 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:24,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash -897319674, now seen corresponding path program 1 times [2018-11-23 10:13:24,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:24,666 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:24,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:24,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:24,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:24,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:24,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:24,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:24,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:24,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {647#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:24,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {647#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:24,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:24,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:24,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:24,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {628#false} is VALID [2018-11-23 10:13:24,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:24,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:24,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:24,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 10000bv32); {628#false} is VALID [2018-11-23 10:13:24,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:24,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:24,865 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:24,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:24,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:24,866 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:24,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:25,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:25,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:25,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:25,106 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:25,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:25,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:25,107 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 10000bv32); {628#false} is VALID [2018-11-23 10:13:25,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:25,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:25,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:25,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {727#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {628#false} is VALID [2018-11-23 10:13:25,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {727#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:13:25,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:25,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:25,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:25,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:25,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:25,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:25,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:25,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:25,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:25,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:25,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:13:25,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:25,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:25,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:13:25,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:25,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:13:25,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:13:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:13:25,194 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2018-11-23 10:13:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:26,948 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 10:13:26,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:13:26,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-23 10:13:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-23 10:13:26,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2018-11-23 10:13:27,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:27,119 INFO L225 Difference]: With dead ends: 59 [2018-11-23 10:13:27,119 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 10:13:27,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 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 10:13:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 10:13:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2018-11-23 10:13:27,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:27,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 33 states. [2018-11-23 10:13:27,195 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 33 states. [2018-11-23 10:13:27,195 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 33 states. [2018-11-23 10:13:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:27,201 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 10:13:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 10:13:27,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:27,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:27,202 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 45 states. [2018-11-23 10:13:27,202 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 45 states. [2018-11-23 10:13:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:27,206 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 10:13:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 10:13:27,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:27,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:27,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:27,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 10:13:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 10:13:27,210 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 21 [2018-11-23 10:13:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:27,211 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 10:13:27,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:13:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 10:13:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:13:27,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:27,212 INFO L402 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:27,213 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:27,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1946563866, now seen corresponding path program 2 times [2018-11-23 10:13:27,213 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:27,214 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:27,232 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:13:27,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:13:27,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:27,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:27,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {1014#true} call ULTIMATE.init(); {1014#true} is VALID [2018-11-23 10:13:27,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {1014#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1014#true} is VALID [2018-11-23 10:13:27,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {1014#true} assume true; {1014#true} is VALID [2018-11-23 10:13:27,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1014#true} {1014#true} #60#return; {1014#true} is VALID [2018-11-23 10:13:27,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {1014#true} call #t~ret4 := main(); {1014#true} is VALID [2018-11-23 10:13:27,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {1014#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1034#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:27,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {1034#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1038#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:27,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {1038#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1042#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:27,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {1042#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1046#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:27,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {1046#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1050#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:13:27,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {1050#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1054#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:27,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {1054#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1058#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:13:27,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {1058#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1062#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:27,672 INFO L273 TraceCheckUtils]: 13: Hoare triple {1062#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1066#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:27,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {1066#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1070#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:13:27,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {1070#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1074#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:27,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {1074#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {1015#false} is VALID [2018-11-23 10:13:27,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {1015#false} ~i~0 := 1bv32; {1015#false} is VALID [2018-11-23 10:13:27,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1015#false} is VALID [2018-11-23 10:13:27,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1015#false} is VALID [2018-11-23 10:13:27,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1015#false} is VALID [2018-11-23 10:13:27,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1015#false} is VALID [2018-11-23 10:13:27,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {1015#false} assume !~bvslt32(~i~0, 10000bv32); {1015#false} is VALID [2018-11-23 10:13:27,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {1015#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1015#false} is VALID [2018-11-23 10:13:27,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {1015#false} is VALID [2018-11-23 10:13:27,680 INFO L256 TraceCheckUtils]: 25: Hoare triple {1015#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1015#false} is VALID [2018-11-23 10:13:27,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {1015#false} ~cond := #in~cond; {1015#false} is VALID [2018-11-23 10:13:27,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {1015#false} assume 0bv32 == ~cond; {1015#false} is VALID [2018-11-23 10:13:27,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {1015#false} assume !false; {1015#false} is VALID [2018-11-23 10:13:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 10:13:27,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:28,189 INFO L273 TraceCheckUtils]: 28: Hoare triple {1015#false} assume !false; {1015#false} is VALID [2018-11-23 10:13:28,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {1015#false} assume 0bv32 == ~cond; {1015#false} is VALID [2018-11-23 10:13:28,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {1015#false} ~cond := #in~cond; {1015#false} is VALID [2018-11-23 10:13:28,190 INFO L256 TraceCheckUtils]: 25: Hoare triple {1015#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1015#false} is VALID [2018-11-23 10:13:28,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {1015#false} is VALID [2018-11-23 10:13:28,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {1015#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1015#false} is VALID [2018-11-23 10:13:28,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {1015#false} assume !~bvslt32(~i~0, 10000bv32); {1015#false} is VALID [2018-11-23 10:13:28,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1015#false} is VALID [2018-11-23 10:13:28,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1015#false} is VALID [2018-11-23 10:13:28,192 INFO L273 TraceCheckUtils]: 19: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1015#false} is VALID [2018-11-23 10:13:28,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {1015#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1015#false} is VALID [2018-11-23 10:13:28,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {1015#false} ~i~0 := 1bv32; {1015#false} is VALID [2018-11-23 10:13:28,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {1150#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {1015#false} is VALID [2018-11-23 10:13:28,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {1154#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1150#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:13:28,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {1158#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1154#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {1162#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1158#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {1166#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1162#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {1170#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1166#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {1174#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1170#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1174#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {1182#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1178#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {1186#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1182#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {1190#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1186#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {1014#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1190#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:28,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {1014#true} call #t~ret4 := main(); {1014#true} is VALID [2018-11-23 10:13:28,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1014#true} {1014#true} #60#return; {1014#true} is VALID [2018-11-23 10:13:28,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {1014#true} assume true; {1014#true} is VALID [2018-11-23 10:13:28,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {1014#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1014#true} is VALID [2018-11-23 10:13:28,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {1014#true} call ULTIMATE.init(); {1014#true} is VALID [2018-11-23 10:13:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:13:28,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:28,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:13:28,265 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-23 10:13:28,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:28,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:13:28,365 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 10:13:28,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:13:28,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:13:28,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:13:28,366 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 24 states. [2018-11-23 10:13:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:34,484 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-23 10:13:34,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:13:34,484 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-23 10:13:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:13:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 112 transitions. [2018-11-23 10:13:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:13:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 112 transitions. [2018-11-23 10:13:34,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 112 transitions. [2018-11-23 10:13:34,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:34,863 INFO L225 Difference]: With dead ends: 89 [2018-11-23 10:13:34,864 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 10:13:34,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 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 10:13:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 10:13:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2018-11-23 10:13:34,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:34,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 49 states. [2018-11-23 10:13:34,953 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 49 states. [2018-11-23 10:13:34,953 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 49 states. [2018-11-23 10:13:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:34,962 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 10:13:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2018-11-23 10:13:34,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:34,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:34,965 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 73 states. [2018-11-23 10:13:34,967 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 73 states. [2018-11-23 10:13:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:34,975 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 10:13:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2018-11-23 10:13:34,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:34,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:34,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:34,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 10:13:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-11-23 10:13:34,979 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 29 [2018-11-23 10:13:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:34,979 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-23 10:13:34,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:13:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-23 10:13:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 10:13:34,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:34,981 INFO L402 BasicCegarLoop]: trace histogram [22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:34,981 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:34,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:34,982 INFO L82 PathProgramCache]: Analyzing trace with hash 937361062, now seen corresponding path program 3 times [2018-11-23 10:13:34,982 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:34,982 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:35,011 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:13:36,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 10:13:36,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:36,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:36,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {1617#true} call ULTIMATE.init(); {1617#true} is VALID [2018-11-23 10:13:36,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {1617#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1617#true} is VALID [2018-11-23 10:13:36,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {1617#true} assume true; {1617#true} is VALID [2018-11-23 10:13:36,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1617#true} {1617#true} #60#return; {1617#true} is VALID [2018-11-23 10:13:36,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {1617#true} call #t~ret4 := main(); {1617#true} is VALID [2018-11-23 10:13:36,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {1617#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1617#true} is VALID [2018-11-23 10:13:36,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,478 INFO L273 TraceCheckUtils]: 17: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {1617#true} assume !~bvslt32(~i~0, 10000bv32); {1617#true} is VALID [2018-11-23 10:13:36,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {1617#true} ~i~0 := 1bv32; {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:36,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1713#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:13:36,487 INFO L273 TraceCheckUtils]: 31: Hoare triple {1713#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1717#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:36,490 INFO L273 TraceCheckUtils]: 32: Hoare triple {1717#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1721#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:13:36,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {1721#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1725#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:36,496 INFO L273 TraceCheckUtils]: 34: Hoare triple {1725#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1729#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:13:36,499 INFO L273 TraceCheckUtils]: 35: Hoare triple {1729#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1733#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:36,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {1733#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1737#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:36,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {1737#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1741#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:36,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {1618#false} is VALID [2018-11-23 10:13:36,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {1618#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1618#false} is VALID [2018-11-23 10:13:36,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {1618#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {1618#false} is VALID [2018-11-23 10:13:36,506 INFO L256 TraceCheckUtils]: 41: Hoare triple {1618#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1618#false} is VALID [2018-11-23 10:13:36,506 INFO L273 TraceCheckUtils]: 42: Hoare triple {1618#false} ~cond := #in~cond; {1618#false} is VALID [2018-11-23 10:13:36,506 INFO L273 TraceCheckUtils]: 43: Hoare triple {1618#false} assume 0bv32 == ~cond; {1618#false} is VALID [2018-11-23 10:13:36,507 INFO L273 TraceCheckUtils]: 44: Hoare triple {1618#false} assume !false; {1618#false} is VALID [2018-11-23 10:13:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 10:13:36,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:36,850 INFO L273 TraceCheckUtils]: 44: Hoare triple {1618#false} assume !false; {1618#false} is VALID [2018-11-23 10:13:36,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {1618#false} assume 0bv32 == ~cond; {1618#false} is VALID [2018-11-23 10:13:36,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {1618#false} ~cond := #in~cond; {1618#false} is VALID [2018-11-23 10:13:36,851 INFO L256 TraceCheckUtils]: 41: Hoare triple {1618#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1618#false} is VALID [2018-11-23 10:13:36,851 INFO L273 TraceCheckUtils]: 40: Hoare triple {1618#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {1618#false} is VALID [2018-11-23 10:13:36,851 INFO L273 TraceCheckUtils]: 39: Hoare triple {1618#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1618#false} is VALID [2018-11-23 10:13:36,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {1781#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {1618#false} is VALID [2018-11-23 10:13:36,852 INFO L273 TraceCheckUtils]: 37: Hoare triple {1785#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1781#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:13:36,857 INFO L273 TraceCheckUtils]: 36: Hoare triple {1789#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1785#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:36,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {1793#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1789#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:36,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {1797#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1793#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:36,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {1801#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1797#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:36,882 INFO L273 TraceCheckUtils]: 32: Hoare triple {1805#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1801#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:36,888 INFO L273 TraceCheckUtils]: 31: Hoare triple {1809#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1805#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:36,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {1813#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1809#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:36,897 INFO L273 TraceCheckUtils]: 29: Hoare triple {1617#true} ~i~0 := 1bv32; {1813#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:36,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {1617#true} assume !~bvslt32(~i~0, 10000bv32); {1617#true} is VALID [2018-11-23 10:13:36,897 INFO L273 TraceCheckUtils]: 27: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,898 INFO L273 TraceCheckUtils]: 25: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,898 INFO L273 TraceCheckUtils]: 24: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,900 INFO L273 TraceCheckUtils]: 16: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {1617#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1617#true} is VALID [2018-11-23 10:13:36,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {1617#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1617#true} is VALID [2018-11-23 10:13:36,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {1617#true} call #t~ret4 := main(); {1617#true} is VALID [2018-11-23 10:13:36,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1617#true} {1617#true} #60#return; {1617#true} is VALID [2018-11-23 10:13:36,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {1617#true} assume true; {1617#true} is VALID [2018-11-23 10:13:36,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {1617#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1617#true} is VALID [2018-11-23 10:13:36,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {1617#true} call ULTIMATE.init(); {1617#true} is VALID [2018-11-23 10:13:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 10:13:36,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:36,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 10:13:36,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-23 10:13:36,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:36,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 10:13:37,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:37,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 10:13:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 10:13:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 10:13:37,003 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 20 states. [2018-11-23 10:13:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:43,422 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2018-11-23 10:13:43,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 10:13:43,422 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-23 10:13:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:13:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 137 transitions. [2018-11-23 10:13:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:13:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 137 transitions. [2018-11-23 10:13:43,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 137 transitions. [2018-11-23 10:13:43,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:43,835 INFO L225 Difference]: With dead ends: 121 [2018-11-23 10:13:43,836 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 10:13:43,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=278, Invalid=478, Unknown=0, NotChecked=0, Total=756 [2018-11-23 10:13:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 10:13:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2018-11-23 10:13:44,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:44,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 59 states. [2018-11-23 10:13:44,071 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 59 states. [2018-11-23 10:13:44,071 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 59 states. [2018-11-23 10:13:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:44,079 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2018-11-23 10:13:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2018-11-23 10:13:44,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:44,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:44,081 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 111 states. [2018-11-23 10:13:44,081 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 111 states. [2018-11-23 10:13:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:44,087 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2018-11-23 10:13:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2018-11-23 10:13:44,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:44,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:44,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:44,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 10:13:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-23 10:13:44,092 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 45 [2018-11-23 10:13:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:44,092 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-23 10:13:44,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 10:13:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 10:13:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 10:13:44,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:44,094 INFO L402 BasicCegarLoop]: trace histogram [22, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:44,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:44,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash 210053254, now seen corresponding path program 4 times [2018-11-23 10:13:44,095 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:44,095 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:44,116 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:13:44,306 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:13:44,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:44,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:45,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {2468#true} call ULTIMATE.init(); {2468#true} is VALID [2018-11-23 10:13:45,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {2468#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2468#true} is VALID [2018-11-23 10:13:45,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {2468#true} assume true; {2468#true} is VALID [2018-11-23 10:13:45,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2468#true} {2468#true} #60#return; {2468#true} is VALID [2018-11-23 10:13:45,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {2468#true} call #t~ret4 := main(); {2468#true} is VALID [2018-11-23 10:13:45,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {2468#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2488#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:45,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {2488#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2492#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {2492#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2496#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:13:45,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {2496#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2500#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {2500#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2504#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {2504#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2508#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {2508#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2512#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:13:45,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {2512#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2516#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {2516#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2520#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {2520#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2524#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:13:45,319 INFO L273 TraceCheckUtils]: 15: Hoare triple {2524#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2528#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,320 INFO L273 TraceCheckUtils]: 16: Hoare triple {2528#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2532#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {2532#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2536#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {2536#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2540#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 10:13:45,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {2540#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2544#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {2544#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2548#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,325 INFO L273 TraceCheckUtils]: 21: Hoare triple {2548#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2552#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:13:45,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {2552#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2556#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {2556#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2560#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {2560#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2564#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:13:45,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {2564#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2568#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {2568#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2572#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-23 10:13:45,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {2572#(= (_ bv21 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2576#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:45,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {2576#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {2469#false} is VALID [2018-11-23 10:13:45,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {2469#false} ~i~0 := 1bv32; {2469#false} is VALID [2018-11-23 10:13:45,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,333 INFO L273 TraceCheckUtils]: 31: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,334 INFO L273 TraceCheckUtils]: 32: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,334 INFO L273 TraceCheckUtils]: 34: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,334 INFO L273 TraceCheckUtils]: 35: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,335 INFO L273 TraceCheckUtils]: 36: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,335 INFO L273 TraceCheckUtils]: 37: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,335 INFO L273 TraceCheckUtils]: 38: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,336 INFO L273 TraceCheckUtils]: 40: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,336 INFO L273 TraceCheckUtils]: 41: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,336 INFO L273 TraceCheckUtils]: 42: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,337 INFO L273 TraceCheckUtils]: 43: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,337 INFO L273 TraceCheckUtils]: 44: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,337 INFO L273 TraceCheckUtils]: 45: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,337 INFO L273 TraceCheckUtils]: 46: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,337 INFO L273 TraceCheckUtils]: 47: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:45,338 INFO L273 TraceCheckUtils]: 48: Hoare triple {2469#false} assume !~bvslt32(~i~0, 10000bv32); {2469#false} is VALID [2018-11-23 10:13:45,338 INFO L273 TraceCheckUtils]: 49: Hoare triple {2469#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2469#false} is VALID [2018-11-23 10:13:45,338 INFO L273 TraceCheckUtils]: 50: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {2469#false} is VALID [2018-11-23 10:13:45,338 INFO L256 TraceCheckUtils]: 51: Hoare triple {2469#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2469#false} is VALID [2018-11-23 10:13:45,338 INFO L273 TraceCheckUtils]: 52: Hoare triple {2469#false} ~cond := #in~cond; {2469#false} is VALID [2018-11-23 10:13:45,339 INFO L273 TraceCheckUtils]: 53: Hoare triple {2469#false} assume 0bv32 == ~cond; {2469#false} is VALID [2018-11-23 10:13:45,339 INFO L273 TraceCheckUtils]: 54: Hoare triple {2469#false} assume !false; {2469#false} is VALID [2018-11-23 10:13:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 10:13:45,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:47,086 INFO L273 TraceCheckUtils]: 54: Hoare triple {2469#false} assume !false; {2469#false} is VALID [2018-11-23 10:13:47,086 INFO L273 TraceCheckUtils]: 53: Hoare triple {2469#false} assume 0bv32 == ~cond; {2469#false} is VALID [2018-11-23 10:13:47,086 INFO L273 TraceCheckUtils]: 52: Hoare triple {2469#false} ~cond := #in~cond; {2469#false} is VALID [2018-11-23 10:13:47,086 INFO L256 TraceCheckUtils]: 51: Hoare triple {2469#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2469#false} is VALID [2018-11-23 10:13:47,087 INFO L273 TraceCheckUtils]: 50: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(3bv32, ~j~0)))), 4bv32); {2469#false} is VALID [2018-11-23 10:13:47,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {2469#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2469#false} is VALID [2018-11-23 10:13:47,087 INFO L273 TraceCheckUtils]: 48: Hoare triple {2469#false} assume !~bvslt32(~i~0, 10000bv32); {2469#false} is VALID [2018-11-23 10:13:47,087 INFO L273 TraceCheckUtils]: 47: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,087 INFO L273 TraceCheckUtils]: 46: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,088 INFO L273 TraceCheckUtils]: 45: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,088 INFO L273 TraceCheckUtils]: 43: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,088 INFO L273 TraceCheckUtils]: 42: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,089 INFO L273 TraceCheckUtils]: 41: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,089 INFO L273 TraceCheckUtils]: 40: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {2469#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(3bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2469#false} is VALID [2018-11-23 10:13:47,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {2469#false} ~i~0 := 1bv32; {2469#false} is VALID [2018-11-23 10:13:47,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {2736#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {2469#false} is VALID [2018-11-23 10:13:47,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {2740#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2736#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-23 10:13:47,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {2744#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2740#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {2748#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2744#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,109 INFO L273 TraceCheckUtils]: 24: Hoare triple {2752#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2748#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {2756#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2752#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {2760#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2756#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {2764#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2760#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {2768#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2764#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {2772#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2768#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2772#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {2780#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2776#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {2784#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2780#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {2788#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2784#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {2792#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2788#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {2796#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2792#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {2800#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2796#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,203 INFO L273 TraceCheckUtils]: 11: Hoare triple {2804#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2800#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {2808#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2804#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {2812#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2808#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {2816#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2812#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {2820#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2816#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {2824#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2820#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {2468#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2824#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-23 10:13:47,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {2468#true} call #t~ret4 := main(); {2468#true} is VALID [2018-11-23 10:13:47,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2468#true} {2468#true} #60#return; {2468#true} is VALID [2018-11-23 10:13:47,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {2468#true} assume true; {2468#true} is VALID [2018-11-23 10:13:47,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {2468#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2468#true} is VALID [2018-11-23 10:13:47,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {2468#true} call ULTIMATE.init(); {2468#true} is VALID [2018-11-23 10:13:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 10:13:47,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:13:47,264 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 55 [2018-11-23 10:13:47,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:47,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:13:47,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:47,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:13:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:13:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:13:47,387 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 48 states. [2018-11-23 10:13:51,421 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:13:51,989 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:13:52,521 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:13:53,097 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:13:53,694 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:13:54,284 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:13:54,893 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:13:55,522 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:14:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:13,633 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2018-11-23 10:14:13,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:14:13,633 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 55 [2018-11-23 10:14:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 184 transitions. [2018-11-23 10:14:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 184 transitions. [2018-11-23 10:14:13,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 184 transitions. [2018-11-23 10:14:14,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:14,157 INFO L225 Difference]: With dead ends: 161 [2018-11-23 10:14:14,157 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 10:14:14,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:14:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 10:14:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2018-11-23 10:14:14,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:14,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 83 states. [2018-11-23 10:14:14,248 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 83 states. [2018-11-23 10:14:14,248 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 83 states. [2018-11-23 10:14:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:14,257 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2018-11-23 10:14:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-11-23 10:14:14,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:14,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:14,258 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 131 states. [2018-11-23 10:14:14,258 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 131 states. [2018-11-23 10:14:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:14,265 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2018-11-23 10:14:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-11-23 10:14:14,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:14,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:14,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:14,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 10:14:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-23 10:14:14,269 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 55 [2018-11-23 10:14:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:14,269 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-23 10:14:14,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:14:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-23 10:14:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 10:14:14,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:14,271 INFO L402 BasicCegarLoop]: trace histogram [46, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:14,271 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:14,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash 243211910, now seen corresponding path program 5 times [2018-11-23 10:14:14,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:14:14,293 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1