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/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:22:06,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:22:06,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:22:06,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:22:06,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:22:06,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:22:06,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:22:06,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:22:06,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:22:06,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:22:06,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:22:06,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:22:06,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:22:06,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:22:06,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:22:06,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:22:06,741 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:22:06,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:22:06,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:22:06,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:22:06,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:22:06,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:22:06,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:22:06,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:22:06,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:22:06,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:22:06,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:22:06,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:22:06,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:22:06,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:22:06,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:22:06,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:22:06,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:22:06,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:22:06,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:22:06,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:22:06,782 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 11:22:06,806 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:22:06,806 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:22:06,807 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:22:06,808 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:22:06,808 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:22:06,808 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:22:06,809 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:22:06,809 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:22:06,809 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:22:06,809 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:22:06,809 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:22:06,810 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:22:06,810 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:22:06,810 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:22:06,810 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:22:06,810 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:22:06,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:22:06,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:22:06,811 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:22:06,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:22:06,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:22:06,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:22:06,812 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:22:06,812 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:22:06,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:22:06,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:22:06,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:22:06,813 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:22:06,813 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:22:06,813 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:22:06,813 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:22:06,813 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:22:06,814 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:22:06,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:22:06,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:22:06,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:22:06,882 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:22:06,882 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:22:06,883 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-23 11:22:06,938 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6922cff/27a7c0005a2940f5af9d5e779f8812af/FLAG291471e15 [2018-11-23 11:22:07,428 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:22:07,429 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-23 11:22:07,436 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6922cff/27a7c0005a2940f5af9d5e779f8812af/FLAG291471e15 [2018-11-23 11:22:07,770 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6922cff/27a7c0005a2940f5af9d5e779f8812af [2018-11-23 11:22:07,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:22:07,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:22:07,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:22:07,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:22:07,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:22:07,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:22:07" (1/1) ... [2018-11-23 11:22:07,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d13d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:07, skipping insertion in model container [2018-11-23 11:22:07,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:22:07" (1/1) ... [2018-11-23 11:22:07,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:22:07,826 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:22:08,061 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:22:08,066 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:22:08,095 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:22:08,120 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:22:08,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08 WrapperNode [2018-11-23 11:22:08,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:22:08,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:22:08,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:22:08,122 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:22:08,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:22:08,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:22:08,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:22:08,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:22:08,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (1/1) ... [2018-11-23 11:22:08,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:22:08,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:22:08,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:22:08,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:22:08,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (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 11:22:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:22:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:22:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:22:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:22:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:22:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:22:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:22:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:22:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:22:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:22:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:22:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:22:09,076 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:22:09,077 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:22:09,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:22:09 BoogieIcfgContainer [2018-11-23 11:22:09,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:22:09,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:22:09,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:22:09,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:22:09,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:22:07" (1/3) ... [2018-11-23 11:22:09,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195b76c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:22:09, skipping insertion in model container [2018-11-23 11:22:09,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:22:08" (2/3) ... [2018-11-23 11:22:09,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195b76c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:22:09, skipping insertion in model container [2018-11-23 11:22:09,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:22:09" (3/3) ... [2018-11-23 11:22:09,086 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-23 11:22:09,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:22:09,106 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:22:09,124 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:22:09,159 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:22:09,160 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:22:09,160 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:22:09,160 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:22:09,160 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:22:09,161 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:22:09,161 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:22:09,161 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:22:09,161 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:22:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 11:22:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:22:09,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:09,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:09,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:09,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 342854797, now seen corresponding path program 1 times [2018-11-23 11:22:09,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:09,203 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 11:22:09,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:09,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:09,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 11:22:09,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-23 11:22:09,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 11:22:09,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #76#return; {33#true} is VALID [2018-11-23 11:22:09,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret9 := main(); {33#true} is VALID [2018-11-23 11:22:09,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {53#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:09,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~j~0, ~SIZE~0); {57#(not (bvult (_ bv1 32) main_~SIZE~0))} is VALID [2018-11-23 11:22:09,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#(not (bvult (_ bv1 32) main_~SIZE~0))} ~k~0 := 1bv32; {61#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:09,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {34#false} is VALID [2018-11-23 11:22:09,761 INFO L256 TraceCheckUtils]: 9: Hoare triple {34#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 11:22:09,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 11:22:09,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 11:22:09,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 11:22:09,765 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 11:22:09,765 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): Stream closed [2018-11-23 11:22:09,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:22:09,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:22:09,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:22:09,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:09,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:22:09,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:09,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:22:09,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:22:09,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:22:09,880 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-11-23 11:22:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:10,558 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2018-11-23 11:22:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:22:10,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:22:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:22:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 11:22:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:22:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 11:22:10,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2018-11-23 11:22:11,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:11,203 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:22:11,204 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:22:11,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:22:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:22:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-11-23 11:22:11,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:11,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 26 states. [2018-11-23 11:22:11,276 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 26 states. [2018-11-23 11:22:11,276 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 26 states. [2018-11-23 11:22:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:11,282 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 11:22:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 11:22:11,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:11,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:11,287 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 33 states. [2018-11-23 11:22:11,287 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 33 states. [2018-11-23 11:22:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:11,292 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 11:22:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 11:22:11,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:11,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:11,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:11,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:22:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 11:22:11,299 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-23 11:22:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:11,299 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 11:22:11,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:22:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 11:22:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:22:11,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:11,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:11,301 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:11,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1336061280, now seen corresponding path program 1 times [2018-11-23 11:22:11,302 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:11,302 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 11:22:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:11,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:11,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-23 11:22:11,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:11,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-23 11:22:11,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:11,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:11,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:11,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2018-11-23 11:22:12,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 11:22:12,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-23 11:22:12,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:4 [2018-11-23 11:22:12,194 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:12,194 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|]. (let ((.cse2 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse1 (select .cse2 (_ bv0 32))) (.cse0 (select .cse2 (_ bv4 32)))) (and (= |main_#t~mem8| .cse0) (= .cse1 |main_#t~mem7|) (not (bvsgt .cse1 .cse0))))) [2018-11-23 11:22:12,195 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (bvsgt |main_#t~mem7| |main_#t~mem8|)) [2018-11-23 11:22:12,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-23 11:22:12,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {266#true} is VALID [2018-11-23 11:22:12,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-23 11:22:12,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #76#return; {266#true} is VALID [2018-11-23 11:22:12,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret9 := main(); {266#true} is VALID [2018-11-23 11:22:12,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {286#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:12,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {290#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:12,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {290#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {290#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:12,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {290#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {297#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:12,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {297#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {301#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-23 11:22:12,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {301#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {305#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:22:12,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {305#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {305#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:22:12,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {305#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !~bvult32(~j~0, ~SIZE~0); {305#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:22:12,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {305#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} ~k~0 := 1bv32; {315#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:22:12,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {315#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {319#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} is VALID [2018-11-23 11:22:12,332 INFO L256 TraceCheckUtils]: 15: Hoare triple {319#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {323#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:12,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {323#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {327#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:12,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {327#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {267#false} is VALID [2018-11-23 11:22:12,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-23 11:22:12,337 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 11:22:12,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:13,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2018-11-23 11:22:40,017 WARN L180 SmtUtils]: Spent 26.72 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-23 11:22:40,026 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,027 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,028 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,034 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2018-11-23 11:22:40,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:40,053 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:22:40,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:40,100 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,100 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,101 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,102 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,102 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,117 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:40,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 79 [2018-11-23 11:22:40,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 11:22:40,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:40,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:40,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:8 [2018-11-23 11:22:40,240 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:40,240 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#v~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (bvmul (_ bv4 32) main_~j~0))) (let ((.cse2 (select .cse0 (bvadd |main_~#v~0.offset| .cse1)))) (or (bvsgt (select .cse0 (bvadd .cse1 |main_~#v~0.offset| (_ bv4294967292 32))) .cse2) (not (let ((.cse3 (store .cse0 (bvadd .cse1 |main_~#v~0.offset|) .cse2))) (bvsgt (select .cse3 |main_~#v~0.offset|) (select .cse3 (bvadd |main_~#v~0.offset| (_ bv4 32))))))))) [2018-11-23 11:22:40,240 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:22:40,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-23 11:22:40,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {337#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {267#false} is VALID [2018-11-23 11:22:40,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {341#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {337#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:22:40,315 INFO L256 TraceCheckUtils]: 15: Hoare triple {319#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {341#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:22:40,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {348#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {319#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} is VALID [2018-11-23 11:22:40,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} ~k~0 := 1bv32; {348#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} is VALID [2018-11-23 11:22:40,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} assume !~bvult32(~j~0, ~SIZE~0); {352#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:22:40,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {352#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:22:40,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#(not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {352#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:22:40,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {366#(or (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))) |main_#t~short4|)} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {362#(not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:22:40,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {366#(or (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))) |main_#t~short4|)} is VALID [2018-11-23 11:22:40,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {370#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~short4 := ~bvsge32(~i~0, 0bv32); {370#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:22:42,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {377#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {370#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is UNKNOWN [2018-11-23 11:22:42,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {377#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-23 11:22:42,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret9 := main(); {266#true} is VALID [2018-11-23 11:22:42,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #76#return; {266#true} is VALID [2018-11-23 11:22:42,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-23 11:22:42,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {266#true} is VALID [2018-11-23 11:22:42,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-23 11:22:42,486 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 11:22:42,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:42,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-23 11:22:42,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-23 11:22:42,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:42,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:22:44,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:44,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:22:44,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:22:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:22:44,695 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 19 states. [2018-11-23 11:22:45,762 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-23 11:22:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:52,086 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 11:22:52,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:22:52,086 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-23 11:22:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:22:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 134 transitions. [2018-11-23 11:22:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:22:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 134 transitions. [2018-11-23 11:22:52,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 134 transitions. [2018-11-23 11:22:53,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:53,578 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:22:53,578 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:22:53,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:22:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:22:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 44. [2018-11-23 11:22:53,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:53,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 44 states. [2018-11-23 11:22:53,635 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 44 states. [2018-11-23 11:22:53,635 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 44 states. [2018-11-23 11:22:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:53,644 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2018-11-23 11:22:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2018-11-23 11:22:53,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:53,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:53,646 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 85 states. [2018-11-23 11:22:53,646 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 85 states. [2018-11-23 11:22:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:53,653 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2018-11-23 11:22:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2018-11-23 11:22:53,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:53,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:53,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:53,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:22:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 11:22:53,659 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 19 [2018-11-23 11:22:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:53,659 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 11:22:53,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:22:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 11:22:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:22:53,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:53,661 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:53,661 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:53,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:53,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1156917258, now seen corresponding path program 1 times [2018-11-23 11:22:53,662 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:53,662 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 11:22:53,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:53,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:53,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {789#true} call ULTIMATE.init(); {789#true} is VALID [2018-11-23 11:22:53,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {789#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {789#true} is VALID [2018-11-23 11:22:53,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {789#true} assume true; {789#true} is VALID [2018-11-23 11:22:53,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {789#true} {789#true} #76#return; {789#true} is VALID [2018-11-23 11:22:53,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {789#true} call #t~ret9 := main(); {789#true} is VALID [2018-11-23 11:22:53,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {789#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {809#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:53,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {809#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {813#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:22:53,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {813#(= main_~i~0 (_ bv0 32))} #t~short4 := ~bvsge32(~i~0, 0bv32); {813#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:22:53,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {813#(= main_~i~0 (_ bv0 32))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {813#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:22:53,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {813#(= main_~i~0 (_ bv0 32))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {813#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:22:53,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {813#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {813#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:22:53,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {813#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvsub32(~i~0, 1bv32); {829#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:53,856 INFO L273 TraceCheckUtils]: 12: Hoare triple {829#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~short4 := ~bvsge32(~i~0, 0bv32); {833#(not |main_#t~short4|)} is VALID [2018-11-23 11:22:53,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {833#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {790#false} is VALID [2018-11-23 11:22:53,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {790#false} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {790#false} is VALID [2018-11-23 11:22:53,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {790#false} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {790#false} is VALID [2018-11-23 11:22:53,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {790#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {790#false} is VALID [2018-11-23 11:22:53,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {790#false} assume !~bvult32(~j~0, ~SIZE~0); {790#false} is VALID [2018-11-23 11:22:53,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {790#false} ~k~0 := 1bv32; {790#false} is VALID [2018-11-23 11:22:53,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {790#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {790#false} is VALID [2018-11-23 11:22:53,858 INFO L256 TraceCheckUtils]: 20: Hoare triple {790#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {790#false} is VALID [2018-11-23 11:22:53,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {790#false} ~cond := #in~cond; {790#false} is VALID [2018-11-23 11:22:53,859 INFO L273 TraceCheckUtils]: 22: Hoare triple {790#false} assume 0bv32 == ~cond; {790#false} is VALID [2018-11-23 11:22:53,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {790#false} assume !false; {790#false} is VALID [2018-11-23 11:22:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:53,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:53,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {790#false} assume !false; {790#false} is VALID [2018-11-23 11:22:53,991 INFO L273 TraceCheckUtils]: 22: Hoare triple {790#false} assume 0bv32 == ~cond; {790#false} is VALID [2018-11-23 11:22:53,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {790#false} ~cond := #in~cond; {790#false} is VALID [2018-11-23 11:22:53,991 INFO L256 TraceCheckUtils]: 20: Hoare triple {790#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {790#false} is VALID [2018-11-23 11:22:53,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {790#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {790#false} is VALID [2018-11-23 11:22:53,992 INFO L273 TraceCheckUtils]: 18: Hoare triple {790#false} ~k~0 := 1bv32; {790#false} is VALID [2018-11-23 11:22:53,992 INFO L273 TraceCheckUtils]: 17: Hoare triple {790#false} assume !~bvult32(~j~0, ~SIZE~0); {790#false} is VALID [2018-11-23 11:22:53,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {790#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {790#false} is VALID [2018-11-23 11:22:53,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {790#false} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {790#false} is VALID [2018-11-23 11:22:53,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {790#false} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {790#false} is VALID [2018-11-23 11:22:53,993 INFO L273 TraceCheckUtils]: 13: Hoare triple {833#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {790#false} is VALID [2018-11-23 11:22:53,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#(not (bvsge main_~i~0 (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {833#(not |main_#t~short4|)} is VALID [2018-11-23 11:22:53,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvsub32(~i~0, 1bv32); {900#(not (bvsge main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:53,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:53,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:53,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:53,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:54,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {920#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {904#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:54,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {789#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {920#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:54,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {789#true} call #t~ret9 := main(); {789#true} is VALID [2018-11-23 11:22:54,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {789#true} {789#true} #76#return; {789#true} is VALID [2018-11-23 11:22:54,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {789#true} assume true; {789#true} is VALID [2018-11-23 11:22:54,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {789#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {789#true} is VALID [2018-11-23 11:22:54,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {789#true} call ULTIMATE.init(); {789#true} is VALID [2018-11-23 11:22:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:54,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:54,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:22:54,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-23 11:22:54,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:54,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:22:54,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:54,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:22:54,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:22:54,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:22:54,067 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 9 states. [2018-11-23 11:22:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:55,216 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2018-11-23 11:22:55,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:22:55,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-23 11:22:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:22:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2018-11-23 11:22:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:22:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2018-11-23 11:22:55,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2018-11-23 11:22:55,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:55,408 INFO L225 Difference]: With dead ends: 87 [2018-11-23 11:22:55,408 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 11:22:55,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:22:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 11:22:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-11-23 11:22:55,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:55,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 48 states. [2018-11-23 11:22:55,452 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 48 states. [2018-11-23 11:22:55,453 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 48 states. [2018-11-23 11:22:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:55,459 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 11:22:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-23 11:22:55,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:55,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:55,461 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 68 states. [2018-11-23 11:22:55,461 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 68 states. [2018-11-23 11:22:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:55,465 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 11:22:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-23 11:22:55,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:55,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:55,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:55,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:22:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 11:22:55,471 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 24 [2018-11-23 11:22:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:55,471 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 11:22:55,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:22:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 11:22:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:22:55,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:55,472 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:55,473 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:55,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash -455852680, now seen corresponding path program 1 times [2018-11-23 11:22:55,474 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:55,474 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 11:22:55,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:55,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:55,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:55,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-11-23 11:22:55,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-11-23 11:22:55,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:55,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:55,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:55,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:38 [2018-11-23 11:22:55,932 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:55,933 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|]. (let ((.cse0 (select |v_#memory_int_14| |main_~#v~0.base|)) (.cse3 (bvmul (_ bv4 32) main_~i~0))) (let ((.cse2 (select .cse0 (bvadd .cse3 |main_~#v~0.offset|))) (.cse1 (bvadd .cse3 |main_~#v~0.offset| (_ bv4 32)))) (and (= |#memory_int| (store |v_#memory_int_14| |main_~#v~0.base| (store .cse0 .cse1 .cse2))) (bvsgt .cse2 main_~key~0) (= main_~key~0 (select .cse0 .cse1)) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32))))) [2018-11-23 11:22:55,933 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select |#memory_int| |main_~#v~0.base|)) (.cse2 (bvmul (_ bv4 32) main_~i~0))) (let ((.cse0 (select .cse1 (bvadd .cse2 |main_~#v~0.offset|)))) (and (bvsgt .cse0 main_~key~0) (= (select .cse1 (bvadd .cse2 |main_~#v~0.offset| (_ bv4 32))) .cse0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32))))) [2018-11-23 11:22:56,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:56,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-11-23 11:22:56,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:56,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-23 11:22:56,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-23 11:22:56,130 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:56,130 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, main_~key~0]. (let ((.cse1 (select |v_#memory_int_15| |main_~#v~0.base|))) (let ((.cse0 (select .cse1 |main_~#v~0.offset|))) (and (bvsgt .cse0 main_~key~0) (= .cse0 (select .cse1 (bvadd |main_~#v~0.offset| (_ bv4 32)))) (= (store |v_#memory_int_15| |main_~#v~0.base| (store .cse1 |main_~#v~0.offset| main_~key~0)) |#memory_int|) (= |main_~#v~0.offset| (_ bv0 32))))) [2018-11-23 11:22:56,130 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (let ((.cse0 (select |#memory_int| |main_~#v~0.base|))) (bvsgt (select .cse0 (bvadd |main_~#v~0.offset| (_ bv4 32))) (select .cse0 |main_~#v~0.offset|))) (= |main_~#v~0.offset| (_ bv0 32))) [2018-11-23 11:22:56,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-23 11:22:56,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:56,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-11-23 11:22:56,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 11:22:56,431 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:56,432 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|]. (let ((.cse2 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse0 (select .cse2 (_ bv4 32))) (.cse1 (select .cse2 (_ bv0 32)))) (and (= |main_#t~mem8| .cse0) (= .cse1 |main_#t~mem7|) (bvsgt .cse0 .cse1)))) [2018-11-23 11:22:56,432 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (bvsgt |main_#t~mem8| |main_#t~mem7|) [2018-11-23 11:22:56,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {1267#true} call ULTIMATE.init(); {1267#true} is VALID [2018-11-23 11:22:56,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {1267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1267#true} is VALID [2018-11-23 11:22:56,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {1267#true} assume true; {1267#true} is VALID [2018-11-23 11:22:56,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1267#true} {1267#true} #76#return; {1267#true} is VALID [2018-11-23 11:22:56,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {1267#true} call #t~ret9 := main(); {1267#true} is VALID [2018-11-23 11:22:56,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1287#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {1287#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1291#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {1291#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1291#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {1291#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1298#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {1298#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {1302#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {1302#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {1306#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {1306#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} ~i~0 := ~bvsub32(~i~0, 1bv32); {1310#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {1310#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1310#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {1310#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4; {1310#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {1310#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {1310#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {1310#(and (= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) main_~key~0) (= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1323#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,588 INFO L273 TraceCheckUtils]: 16: Hoare triple {1323#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1323#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {1323#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !~bvult32(~j~0, ~SIZE~0); {1323#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,589 INFO L273 TraceCheckUtils]: 18: Hoare triple {1323#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= |main_~#v~0.offset| (_ bv0 32)))} ~k~0 := 1bv32; {1333#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:56,601 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#(and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1337#(bvsgt |main_#t~mem8| |main_#t~mem7|)} is VALID [2018-11-23 11:22:56,604 INFO L256 TraceCheckUtils]: 20: Hoare triple {1337#(bvsgt |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1341#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:56,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {1341#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1345#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:56,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {1345#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1268#false} is VALID [2018-11-23 11:22:56,621 INFO L273 TraceCheckUtils]: 23: Hoare triple {1268#false} assume !false; {1268#false} is VALID [2018-11-23 11:22:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:56,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:57,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 83 [2018-11-23 11:22:57,653 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:57,654 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:57,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:57,659 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:57,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 100 [2018-11-23 11:23:06,178 WARN L180 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-23 11:23:06,193 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:06,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:06,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:06,198 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:06,199 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:06,210 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:06,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 81 [2018-11-23 11:23:06,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 11:23:08,331 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (_ bv4 32)) (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:23:08,340 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:10,345 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (bvmul (_ bv4 32) main_~j~0)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:23:12,352 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:23:12,357 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,371 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,375 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,385 INFO L303 Elim1Store]: Index analysis took 6129 ms [2018-11-23 11:23:12,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 72 [2018-11-23 11:23:12,452 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-23 11:23:12,468 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,468 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,471 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,471 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,480 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 84 [2018-11-23 11:23:12,602 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-23 11:23:14,763 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:14,764 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:16,919 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (bvmul (_ bv4 32) main_~j~0)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:23:16,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:19,005 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:23:19,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:19,007 INFO L303 Elim1Store]: Index analysis took 6400 ms [2018-11-23 11:23:19,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2018-11-23 11:23:19,012 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:21,067 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:23,116 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (bvmul (_ bv4 32) main_~j~0)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:23:23,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:23,118 INFO L303 Elim1Store]: Index analysis took 4099 ms [2018-11-23 11:23:23,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-23 11:23:23,121 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:23,129 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:23,129 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:25,138 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#v~0.offset| (bvmul (_ bv4 32) main_~j~0)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:23:27,145 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:23:27,148 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:27,159 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:27,162 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:27,168 INFO L303 Elim1Store]: Index analysis took 4043 ms [2018-11-23 11:23:27,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 74 [2018-11-23 11:23:27,252 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-23 11:23:27,304 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:27,306 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:27,306 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:27,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-11-23 11:23:27,318 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:28,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-11-23 11:23:28,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,329 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:99, output treesize:8 [2018-11-23 11:23:28,339 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:28,339 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#v~0.base|]. (let ((.cse4 (bvmul (_ bv4 32) main_~j~0))) (let ((.cse3 (select |#memory_int| |main_~#v~0.base|)) (.cse5 (bvadd .cse4 |main_~#v~0.offset| (_ bv4294967292 32)))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 (bvadd |main_~#v~0.offset| .cse4)))) (or (not (bvsgt .cse0 .cse1)) (let ((.cse2 (store (store .cse3 (bvadd .cse4 |main_~#v~0.offset|) .cse0) .cse5 .cse1))) (bvsle (select .cse2 |main_~#v~0.offset|) (select .cse2 (bvadd |main_~#v~0.offset| (_ bv4 32))))))))) [2018-11-23 11:23:28,339 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:23:28,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {1268#false} assume !false; {1268#false} is VALID [2018-11-23 11:23:28,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {1355#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1268#false} is VALID [2018-11-23 11:23:28,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {1359#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1355#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:23:28,413 INFO L256 TraceCheckUtils]: 20: Hoare triple {1363#(bvsle |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1359#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:23:28,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {1367#(bvsle (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1363#(bvsle |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-23 11:23:28,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {1371#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} ~k~0 := 1bv32; {1367#(bvsle (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|)))} is VALID [2018-11-23 11:23:28,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {1371#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume !~bvult32(~j~0, ~SIZE~0); {1371#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {1371#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1371#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {1381#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1371#(bvsle (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {1381#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {1381#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {1381#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume !#t~short4; {1381#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {1381#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1381#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,535 INFO L273 TraceCheckUtils]: 11: Hoare triple {1394#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} ~i~0 := ~bvsub32(~i~0, 1bv32); {1381#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {1398#(bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {1394#(bvsle (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {1402#(or (not |main_#t~short4|) (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {1398#(bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))} is VALID [2018-11-23 11:23:28,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {1406#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1402#(or (not |main_#t~short4|) (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:23:28,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {1406#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1406#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-23 11:23:28,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {1413#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1406#(or (bvsle (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-23 11:23:28,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1413#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-23 11:23:28,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {1267#true} call #t~ret9 := main(); {1267#true} is VALID [2018-11-23 11:23:28,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1267#true} {1267#true} #76#return; {1267#true} is VALID [2018-11-23 11:23:28,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {1267#true} assume true; {1267#true} is VALID [2018-11-23 11:23:28,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {1267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1267#true} is VALID [2018-11-23 11:23:28,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {1267#true} call ULTIMATE.init(); {1267#true} is VALID [2018-11-23 11:23:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:28,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:28,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:23:28,668 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-11-23 11:23:28,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:28,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:23:29,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:29,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:23:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:23:29,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:23:29,042 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 24 states. [2018-11-23 11:23:32,019 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-23 11:23:32,554 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-11-23 11:23:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:42,539 INFO L93 Difference]: Finished difference Result 144 states and 179 transitions. [2018-11-23 11:23:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:23:42,540 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-11-23 11:23:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:23:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 142 transitions. [2018-11-23 11:23:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:23:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 142 transitions. [2018-11-23 11:23:42,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 142 transitions. [2018-11-23 11:23:45,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 141 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:45,593 INFO L225 Difference]: With dead ends: 144 [2018-11-23 11:23:45,593 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 11:23:45,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=298, Invalid=1958, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:23:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 11:23:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 48. [2018-11-23 11:23:45,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:45,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 48 states. [2018-11-23 11:23:45,643 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 48 states. [2018-11-23 11:23:45,643 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 48 states. [2018-11-23 11:23:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,650 INFO L93 Difference]: Finished difference Result 142 states and 177 transitions. [2018-11-23 11:23:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2018-11-23 11:23:45,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:45,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:45,652 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 142 states. [2018-11-23 11:23:45,652 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 142 states. [2018-11-23 11:23:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,659 INFO L93 Difference]: Finished difference Result 142 states and 177 transitions. [2018-11-23 11:23:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2018-11-23 11:23:45,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:45,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:45,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:45,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:23:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 11:23:45,662 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 24 [2018-11-23 11:23:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:45,663 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 11:23:45,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:23:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 11:23:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:23:45,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:45,664 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:45,664 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:45,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:45,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2145817879, now seen corresponding path program 1 times [2018-11-23 11:23:45,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:45,665 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 11:23:45,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:45,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:45,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {2022#true} call ULTIMATE.init(); {2022#true} is VALID [2018-11-23 11:23:45,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {2022#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2022#true} is VALID [2018-11-23 11:23:45,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {2022#true} assume true; {2022#true} is VALID [2018-11-23 11:23:45,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2022#true} {2022#true} #76#return; {2022#true} is VALID [2018-11-23 11:23:45,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {2022#true} call #t~ret9 := main(); {2022#true} is VALID [2018-11-23 11:23:45,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {2022#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {2042#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:45,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {2042#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {2046#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2062#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:45,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {2062#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} assume !~bvult32(~j~0, ~SIZE~0); {2066#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)))} is VALID [2018-11-23 11:23:45,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {2066#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)))} ~k~0 := 1bv32; {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,890 INFO L256 TraceCheckUtils]: 15: Hoare triple {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2022#true} is VALID [2018-11-23 11:23:45,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {2022#true} ~cond := #in~cond; {2022#true} is VALID [2018-11-23 11:23:45,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {2022#true} assume !(0bv32 == ~cond); {2022#true} is VALID [2018-11-23 11:23:45,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {2022#true} assume true; {2022#true} is VALID [2018-11-23 11:23:45,892 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2022#true} {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #80#return; {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem7;havoc #t~mem8; {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:45,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {2070#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2095#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 11:23:45,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {2095#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2023#false} is VALID [2018-11-23 11:23:45,895 INFO L256 TraceCheckUtils]: 23: Hoare triple {2023#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2023#false} is VALID [2018-11-23 11:23:45,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {2023#false} ~cond := #in~cond; {2023#false} is VALID [2018-11-23 11:23:45,896 INFO L273 TraceCheckUtils]: 25: Hoare triple {2023#false} assume 0bv32 == ~cond; {2023#false} is VALID [2018-11-23 11:23:45,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {2023#false} assume !false; {2023#false} is VALID [2018-11-23 11:23:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:45,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:46,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {2023#false} assume !false; {2023#false} is VALID [2018-11-23 11:23:46,172 INFO L273 TraceCheckUtils]: 25: Hoare triple {2023#false} assume 0bv32 == ~cond; {2023#false} is VALID [2018-11-23 11:23:46,172 INFO L273 TraceCheckUtils]: 24: Hoare triple {2023#false} ~cond := #in~cond; {2023#false} is VALID [2018-11-23 11:23:46,172 INFO L256 TraceCheckUtils]: 23: Hoare triple {2023#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2023#false} is VALID [2018-11-23 11:23:46,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {2123#(not (bvult main_~k~0 main_~SIZE~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2023#false} is VALID [2018-11-23 11:23:46,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2123#(not (bvult main_~k~0 main_~SIZE~0))} is VALID [2018-11-23 11:23:46,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} havoc #t~mem7;havoc #t~mem8; {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,176 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2022#true} {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} #80#return; {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {2022#true} assume true; {2022#true} is VALID [2018-11-23 11:23:46,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {2022#true} assume !(0bv32 == ~cond); {2022#true} is VALID [2018-11-23 11:23:46,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {2022#true} ~cond := #in~cond; {2022#true} is VALID [2018-11-23 11:23:46,176 INFO L256 TraceCheckUtils]: 15: Hoare triple {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2022#true} is VALID [2018-11-23 11:23:46,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {2152#(not (bvult (_ bv2 32) main_~SIZE~0))} ~k~0 := 1bv32; {2127#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {2156#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} assume !~bvult32(~j~0, ~SIZE~0); {2152#(not (bvult (_ bv2 32) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2156#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} is VALID [2018-11-23 11:23:46,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {2176#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {2160#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:23:46,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {2022#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {2176#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} is VALID [2018-11-23 11:23:46,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {2022#true} call #t~ret9 := main(); {2022#true} is VALID [2018-11-23 11:23:46,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2022#true} {2022#true} #76#return; {2022#true} is VALID [2018-11-23 11:23:46,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {2022#true} assume true; {2022#true} is VALID [2018-11-23 11:23:46,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {2022#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2022#true} is VALID [2018-11-23 11:23:46,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {2022#true} call ULTIMATE.init(); {2022#true} is VALID [2018-11-23 11:23:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:46,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:46,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:23:46,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-11-23 11:23:46,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:46,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:23:46,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:46,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:23:46,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:23:46,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:23:46,294 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 14 states. [2018-11-23 11:23:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,474 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-11-23 11:23:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:23:47,474 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-11-23 11:23:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:23:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-23 11:23:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:23:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-23 11:23:47,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2018-11-23 11:23:47,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:47,590 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:23:47,591 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:23:47,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:23:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:23:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-11-23 11:23:47,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:47,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 52 states. [2018-11-23 11:23:47,628 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 52 states. [2018-11-23 11:23:47,628 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 52 states. [2018-11-23 11:23:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,631 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 11:23:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 11:23:47,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:47,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:47,632 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 66 states. [2018-11-23 11:23:47,632 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 66 states. [2018-11-23 11:23:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,634 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 11:23:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 11:23:47,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:47,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:47,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:47,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:23:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-23 11:23:47,638 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 27 [2018-11-23 11:23:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:47,638 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-23 11:23:47,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:23:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 11:23:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:23:47,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:47,639 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:47,639 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:47,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash 504300867, now seen corresponding path program 2 times [2018-11-23 11:23:47,640 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:47,640 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 11:23:47,660 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:23:47,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:23:47,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:47,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:47,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 11:23:47,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:23:47,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:47,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:47,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:47,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-23 11:23:47,906 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:47,906 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, main_~key~0]. (and (= (store |v_#memory_int_19| |main_~#v~0.base| (store (select |v_#memory_int_19| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|) main_~key~0)) |#memory_int|) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32))) [2018-11-23 11:23:47,906 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32))) [2018-11-23 11:23:48,289 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-23 11:23:48,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-23 11:23:48,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:48,478 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:48,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-11-23 11:23:48,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:48,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:32 [2018-11-23 11:23:48,550 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:48,551 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, |main_#t~mem3|]. (let ((.cse0 (select |v_#memory_int_20| |main_~#v~0.base|))) (and (bvsgt |main_#t~mem3| main_~key~0) (= (select .cse0 (bvadd |main_~#v~0.offset| (_ bv8 32))) main_~key~0) (= |main_~#v~0.offset| (_ bv0 32)) (= (store |v_#memory_int_20| |main_~#v~0.base| (let ((.cse1 (bvmul (_ bv4 32) main_~i~0))) (store .cse0 (bvadd .cse1 |main_~#v~0.offset| (_ bv4 32)) (select .cse0 (bvadd .cse1 |main_~#v~0.offset|))))) |#memory_int|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:23:48,551 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~mem3|]. (and (bvsgt |main_#t~mem3| main_~key~0) (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (bvmul (_ bv4 32) main_~i~0))) (= (select .cse0 (bvadd .cse1 |main_~#v~0.offset| (_ bv4 32))) (select .cse0 (bvadd .cse1 |main_~#v~0.offset|)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:23:48,959 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-11-23 11:23:49,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-23 11:23:49,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:49,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:49,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:49,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-23 11:23:49,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:49,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:49,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:49,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2018-11-23 11:23:49,192 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:49,193 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, main_~key~0, |main_#t~mem3|]. (let ((.cse1 (bvadd |main_~#v~0.offset| (_ bv4 32))) (.cse0 (select |v_#memory_int_21| |main_~#v~0.base|))) (and (bvsgt |main_#t~mem3| main_~key~0) (= |#memory_int| (store |v_#memory_int_21| |main_~#v~0.base| (store .cse0 .cse1 main_~key~0))) (= (select .cse0 .cse1) (select .cse0 (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not (bvsgt (select .cse0 |main_~#v~0.offset|) main_~key~0)) (= |main_~#v~0.offset| (_ bv0 32)))) [2018-11-23 11:23:49,193 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~mem3|]. (let ((.cse1 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse0 (select .cse1 (bvadd |main_~#v~0.offset| (_ bv4 32))))) (and (bvsgt |main_#t~mem3| .cse0) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select .cse1 |main_~#v~0.offset|) .cse0))))) [2018-11-23 11:23:49,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-11-23 11:23:49,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-11-23 11:23:49,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:49,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:49,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:49,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:8 [2018-11-23 11:23:49,457 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:49,457 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|, |main_#t~mem3|]. (let ((.cse2 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse1 (select .cse2 (_ bv0 32))) (.cse0 (select .cse2 (_ bv4 32)))) (and (bvsgt |main_#t~mem3| .cse0) (= |main_#t~mem8| .cse0) (= .cse1 |main_#t~mem7|) (not (bvsgt .cse1 .cse0))))) [2018-11-23 11:23:49,457 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~mem3|]. (and (bvsgt |main_#t~mem3| |main_#t~mem8|) (not (bvsgt |main_#t~mem7| |main_#t~mem8|))) [2018-11-23 11:23:49,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {2513#true} call ULTIMATE.init(); {2513#true} is VALID [2018-11-23 11:23:49,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {2513#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2513#true} is VALID [2018-11-23 11:23:49,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {2513#true} assume true; {2513#true} is VALID [2018-11-23 11:23:49,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2513#true} {2513#true} #76#return; {2513#true} is VALID [2018-11-23 11:23:49,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {2513#true} call #t~ret9 := main(); {2513#true} is VALID [2018-11-23 11:23:49,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {2513#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {2533#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {2533#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {2537#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {2537#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2537#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {2537#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2537#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {2537#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {2537#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {2537#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2533#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {2533#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2553#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {2553#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {2557#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:49,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {2557#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2557#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:49,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {2557#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2564#(or (and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:49,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {2564#(or (and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {2568#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:49,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {2568#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, 2bv32);call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5; {2572#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:49,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {2572#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvsub32(~i~0, 1bv32); {2576#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {2576#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2576#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:23:49,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {2576#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2583#(or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) |main_#t~short4| (= |main_~#v~0.offset| (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0))))} is VALID [2018-11-23 11:23:49,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {2583#(or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) |main_#t~short4| (= |main_~#v~0.offset| (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0))))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {2587#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-23 11:23:49,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {2587#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2591#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:23:49,667 INFO L273 TraceCheckUtils]: 22: Hoare triple {2591#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2591#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:23:49,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {2591#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !~bvult32(~j~0, ~SIZE~0); {2591#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:23:49,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {2591#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} ~k~0 := 1bv32; {2601#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:23:49,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {2601#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2605#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| |main_#t~mem8|)) (not (bvsgt |main_#t~mem7| |main_#t~mem8|)))} is VALID [2018-11-23 11:23:49,687 INFO L256 TraceCheckUtils]: 26: Hoare triple {2605#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| |main_#t~mem8|)) (not (bvsgt |main_#t~mem7| |main_#t~mem8|)))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2609#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:49,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {2609#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2613#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:49,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {2613#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2514#false} is VALID [2018-11-23 11:23:49,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {2514#false} assume !false; {2514#false} is VALID [2018-11-23 11:23:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:49,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:55,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 188 [2018-11-23 11:24:02,497 WARN L180 SmtUtils]: Spent 6.92 s on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-11-23 11:24:02,521 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:02,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 120 [2018-11-23 11:24:02,754 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-23 11:24:02,792 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:02,792 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:02,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:02,795 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:02,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 127 [2018-11-23 11:24:11,631 WARN L180 SmtUtils]: Spent 8.75 s on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-23 11:24:11,649 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:11,650 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:11,668 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:11,675 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:13,869 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:24:16,035 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:24:16,038 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,038 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,067 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,077 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,088 INFO L303 Elim1Store]: Index analysis took 4447 ms [2018-11-23 11:24:16,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 120 [2018-11-23 11:24:16,147 INFO L267 ElimStorePlain]: Start of recursive call 5: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-11-23 11:24:16,152 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:24:16,153 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:16,187 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,193 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,199 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,204 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,205 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,205 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,206 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,206 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,241 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:16,263 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-11-23 11:24:16,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 130 [2018-11-23 11:24:16,317 INFO L267 ElimStorePlain]: Start of recursive call 7: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-23 11:24:16,322 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:24:16,323 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:18,365 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4 32)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:24:18,368 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:18,372 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:18,376 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:20,497 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:24:22,652 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:24:22,656 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:24,662 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|)) [2018-11-23 11:24:24,689 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:24,704 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:24,715 INFO L303 Elim1Store]: Index analysis took 8387 ms [2018-11-23 11:24:24,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 111 [2018-11-23 11:24:24,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-11-23 11:24:26,800 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4 32)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:24:26,803 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:26,809 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:26,819 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:26,819 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:26,820 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:26,820 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:28,825 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|)) [2018-11-23 11:24:28,844 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:28,860 INFO L303 Elim1Store]: Index analysis took 4070 ms [2018-11-23 11:24:28,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 118 [2018-11-23 11:24:28,911 INFO L267 ElimStorePlain]: Start of recursive call 10: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-11-23 11:24:28,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:28,924 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:28,925 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:28,926 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:28,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 65 [2018-11-23 11:24:28,951 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:24:31,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 38 dim-0 vars, and 17 xjuncts. [2018-11-23 11:24:33,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 38 dim-0 vars, and 17 xjuncts. [2018-11-23 11:24:33,330 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:33,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:33,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 182 [2018-11-23 11:24:33,611 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:24:33,652 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:33,653 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:33,654 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:33,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 132 [2018-11-23 11:25:09,883 WARN L180 SmtUtils]: Spent 36.04 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-11-23 11:25:09,894 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:25:09,895 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:09,904 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:09,919 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:09,947 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:09,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2018-11-23 11:25:09,975 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:25:09,984 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:10,007 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:10,031 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:10,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 49 [2018-11-23 11:25:10,057 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 11:25:10,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:10,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-23 11:25:10,094 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:10,124 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:10,144 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:10,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 58 [2018-11-23 11:25:10,211 INFO L267 ElimStorePlain]: Start of recursive call 18: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 11:25:10,218 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:25:10,220 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:10,255 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:10,295 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:10,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 62 [2018-11-23 11:25:10,397 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.