java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/array-tiling/pnr2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:54:54,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:54:54,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:54:54,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:54:54,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:54:54,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:54:54,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:54:54,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:54:54,723 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:54:54,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:54:54,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:54:54,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:54:54,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:54:54,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:54:54,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:54:54,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:54:54,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:54:54,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:54:54,734 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:54:54,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:54:54,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:54:54,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:54:54,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:54:54,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:54:54,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:54:54,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:54:54,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:54:54,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:54:54,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:54:54,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:54:54,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:54:54,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:54:54,746 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:54:54,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:54:54,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:54:54,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:54:54,748 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:54:54,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:54:54,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:54:54,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:54:54,764 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:54:54,765 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:54:54,765 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:54:54,765 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:54:54,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:54:54,766 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:54:54,766 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:54:54,766 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:54:54,766 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:54:54,766 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:54:54,767 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:54:54,767 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:54:54,767 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:54:54,767 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:54:54,767 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:54:54,768 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:54:54,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:54:54,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:54:54,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:54:54,768 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:54:54,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:54:54,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:54:54,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:54:54,769 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:54:54,769 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:54:54,770 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:54:54,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:54:54,770 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:54:54,770 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:54:54,770 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:54:54,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:54:54,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:54:54,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:54:54,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:54:54,833 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:54:54,834 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr2_true-unreach-call.i [2018-11-14 17:54:54,892 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed3a5c8f/6633187914e846c4a4e7b0295e92c15d/FLAGf5183b7ea [2018-11-14 17:54:55,312 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:54:55,313 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr2_true-unreach-call.i [2018-11-14 17:54:55,321 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed3a5c8f/6633187914e846c4a4e7b0295e92c15d/FLAGf5183b7ea [2018-11-14 17:54:55,337 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed3a5c8f/6633187914e846c4a4e7b0295e92c15d [2018-11-14 17:54:55,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:54:55,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:54:55,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:54:55,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:54:55,362 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:54:55,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aefa37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55, skipping insertion in model container [2018-11-14 17:54:55,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:54:55,409 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:54:55,656 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:54:55,662 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:54:55,693 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:54:55,718 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:54:55,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55 WrapperNode [2018-11-14 17:54:55,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:54:55,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:54:55,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:54:55,720 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:54:55,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (1/1) ... [2018-11-14 17:54:55,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:54:55,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:54:55,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:54:55,782 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:54:55,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:54:55,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:54:55,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:54:55,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:54:55,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:54:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2018-11-14 17:54:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:54:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:54:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:54:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:54:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:54:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:54:56,535 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:54:56,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:54:56 BoogieIcfgContainer [2018-11-14 17:54:56,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:54:56,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:54:56,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:54:56,540 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:54:56,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:54:55" (1/3) ... [2018-11-14 17:54:56,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d42144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:54:56, skipping insertion in model container [2018-11-14 17:54:56,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:55" (2/3) ... [2018-11-14 17:54:56,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d42144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:54:56, skipping insertion in model container [2018-11-14 17:54:56,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:54:56" (3/3) ... [2018-11-14 17:54:56,544 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr2_true-unreach-call.i [2018-11-14 17:54:56,552 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:54:56,560 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:54:56,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:54:56,609 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:54:56,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:54:56,610 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:54:56,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:54:56,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:54:56,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:54:56,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:54:56,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:54:56,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:54:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-14 17:54:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:54:56,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:56,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:56,641 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:56,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash -459148842, now seen corresponding path program 1 times [2018-11-14 17:54:56,652 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:56,653 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:54:56,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:54:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:56,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:56,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-14 17:54:56,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {35#true} is VALID [2018-11-14 17:54:56,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-14 17:54:56,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #76#return; {35#true} is VALID [2018-11-14 17:54:56,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2018-11-14 17:54:56,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {35#true} is VALID [2018-11-14 17:54:56,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {35#true} is VALID [2018-11-14 17:54:56,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {35#true} is VALID [2018-11-14 17:54:56,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-14 17:54:56,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0bv32; {36#false} is VALID [2018-11-14 17:54:56,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 17:54:56,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {36#false} is VALID [2018-11-14 17:54:56,968 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {36#false} is VALID [2018-11-14 17:54:56,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-14 17:54:56,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume ~cond == 0bv32; {36#false} is VALID [2018-11-14 17:54:56,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-14 17:54:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:54:56,973 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:54:56,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:54:56,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:54:56,984 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:54:56,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:56,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:54:57,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:57,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:54:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:54:57,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:54:57,112 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-14 17:54:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:57,282 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-14 17:54:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:54:57,282 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:54:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:54:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-14 17:54:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:54:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-14 17:54:57,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2018-11-14 17:54:57,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:57,619 INFO L225 Difference]: With dead ends: 50 [2018-11-14 17:54:57,620 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 17:54:57,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:54:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 17:54:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 17:54:57,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:57,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 17:54:57,669 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:54:57,669 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:54:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:57,674 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 17:54:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 17:54:57,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:57,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:57,675 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:54:57,676 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:54:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:57,680 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 17:54:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 17:54:57,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:57,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:57,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:57,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:54:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-14 17:54:57,687 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2018-11-14 17:54:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:57,687 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-14 17:54:57,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:54:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 17:54:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:54:57,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:57,689 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:57,689 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:57,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:57,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1968916477, now seen corresponding path program 1 times [2018-11-14 17:54:57,690 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:57,690 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:54:57,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:54:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:57,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:57,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-14 17:54:57,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {231#true} is VALID [2018-11-14 17:54:57,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-14 17:54:57,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #76#return; {231#true} is VALID [2018-11-14 17:54:57,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret7 := main(); {231#true} is VALID [2018-11-14 17:54:57,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {231#true} is VALID [2018-11-14 17:54:57,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {231#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {254#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-14 17:54:57,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {254#(bvsgt ~SIZE~0 (_ bv1 32))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {258#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:54:57,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {258#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {258#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:54:57,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {258#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {232#false} is VALID [2018-11-14 17:54:57,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {232#false} ~i~0 := 0bv32; {232#false} is VALID [2018-11-14 17:54:57,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {232#false} assume true; {232#false} is VALID [2018-11-14 17:54:57,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {232#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {232#false} is VALID [2018-11-14 17:54:57,977 INFO L256 TraceCheckUtils]: 13: Hoare triple {232#false} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {232#false} is VALID [2018-11-14 17:54:57,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2018-11-14 17:54:57,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {232#false} assume ~cond == 0bv32; {232#false} is VALID [2018-11-14 17:54:57,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-14 17:54:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:54:57,981 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:54:57,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:54:57,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:54:57,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 17:54:57,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:57,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:54:58,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:58,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:54:58,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:54:58,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:54:58,219 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-11-14 17:54:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:59,135 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-14 17:54:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:54:59,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 17:54:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:54:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 17:54:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:54:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 17:54:59,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-14 17:54:59,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:59,299 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:54:59,299 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:54:59,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:54:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:54:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-14 17:54:59,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:59,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2018-11-14 17:54:59,311 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2018-11-14 17:54:59,311 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2018-11-14 17:54:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:59,315 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:54:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:54:59,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:59,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:59,317 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2018-11-14 17:54:59,317 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2018-11-14 17:54:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:59,320 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:54:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:54:59,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:59,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:59,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:59,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:54:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 17:54:59,324 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2018-11-14 17:54:59,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:59,325 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 17:54:59,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:54:59,325 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 17:54:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:54:59,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:59,326 INFO L375 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] [2018-11-14 17:54:59,326 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:59,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1170631402, now seen corresponding path program 1 times [2018-11-14 17:54:59,327 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:59,328 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:54:59,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:54:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:59,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:59,685 INFO L477 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 16 treesize of output 13 [2018-11-14 17:54:59,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 17:54:59,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:54:59,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:54:59,949 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-14 17:54:59,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-14 17:54:59,962 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:00,082 INFO L477 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 22 treesize of output 17 [2018-11-14 17:55:00,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:55:00,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-11-14 17:55:00,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:00,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:00,148 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-14 17:55:00,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-11-14 17:55:00,177 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:00,343 INFO L477 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 16 treesize of output 12 [2018-11-14 17:55:00,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-14 17:55:00,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:00,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:00,359 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-14 17:55:00,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-14 17:55:00,366 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:00,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2018-11-14 17:55:00,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {442#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {442#true} is VALID [2018-11-14 17:55:00,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {442#true} assume true; {442#true} is VALID [2018-11-14 17:55:00,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {442#true} {442#true} #76#return; {442#true} is VALID [2018-11-14 17:55:00,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {442#true} call #t~ret7 := main(); {442#true} is VALID [2018-11-14 17:55:00,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {442#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {442#true} is VALID [2018-11-14 17:55:00,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {442#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {465#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:00,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {465#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {469#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:00,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {469#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:00,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {469#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:00,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {479#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:00,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {479#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {479#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:00,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {479#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {486#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:00,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {486#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {486#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:00,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {486#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {486#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:00,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {486#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {486#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:00,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {486#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {499#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:00,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {499#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {499#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:00,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {499#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {506#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:00,475 INFO L256 TraceCheckUtils]: 19: Hoare triple {506#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {510#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:00,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {510#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {514#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:00,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {514#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {443#false} is VALID [2018-11-14 17:55:00,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {443#false} assume !false; {443#false} is VALID [2018-11-14 17:55:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:00,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:55:00,973 INFO L477 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 16 treesize of output 14 [2018-11-14 17:55:01,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 [2018-11-14 17:55:01,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:01,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:01,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:01,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-14 17:55:01,038 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:01,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {443#false} assume !false; {443#false} is VALID [2018-11-14 17:55:01,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {524#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {443#false} is VALID [2018-11-14 17:55:01,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {528#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {524#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:55:01,095 INFO L256 TraceCheckUtils]: 19: Hoare triple {532#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {528#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:55:01,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {536#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {532#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-14 17:55:01,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {536#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {536#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:01,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0bv32; {536#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:01,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:01,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume true; {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:01,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:01,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:01,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:01,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {562#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {543#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:01,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {562#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {562#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-14 17:55:01,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {562#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} assume true; {562#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-14 17:55:01,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {442#true} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {562#(= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-14 17:55:01,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {442#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {442#true} is VALID [2018-11-14 17:55:01,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {442#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {442#true} is VALID [2018-11-14 17:55:01,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {442#true} call #t~ret7 := main(); {442#true} is VALID [2018-11-14 17:55:01,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {442#true} {442#true} #76#return; {442#true} is VALID [2018-11-14 17:55:01,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {442#true} assume true; {442#true} is VALID [2018-11-14 17:55:01,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {442#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {442#true} is VALID [2018-11-14 17:55:01,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2018-11-14 17:55:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:01,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:55:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-14 17:55:01,125 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 17:55:01,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:01,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:55:01,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:01,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:55:01,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:55:01,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:55:01,251 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 16 states. [2018-11-14 17:55:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:03,633 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-14 17:55:03,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:55:03,634 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 17:55:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:55:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:55:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-14 17:55:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:55:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-14 17:55:03,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 76 transitions. [2018-11-14 17:55:03,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:03,863 INFO L225 Difference]: With dead ends: 65 [2018-11-14 17:55:03,864 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 17:55:03,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:55:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 17:55:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2018-11-14 17:55:03,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:55:03,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 42 states. [2018-11-14 17:55:03,958 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 42 states. [2018-11-14 17:55:03,958 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 42 states. [2018-11-14 17:55:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:03,966 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-14 17:55:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-14 17:55:03,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:03,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:03,968 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 63 states. [2018-11-14 17:55:03,968 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 63 states. [2018-11-14 17:55:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:03,973 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-14 17:55:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-14 17:55:03,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:03,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:03,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:55:03,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:55:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:55:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-14 17:55:03,978 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 23 [2018-11-14 17:55:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:55:03,978 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-14 17:55:03,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:55:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 17:55:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:55:03,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:03,980 INFO L375 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] [2018-11-14 17:55:03,980 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:03,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1757437416, now seen corresponding path program 1 times [2018-11-14 17:55:03,981 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:03,981 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:55:03,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:55:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:04,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:04,178 INFO L477 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 16 treesize of output 13 [2018-11-14 17:55:04,185 INFO L477 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 13 treesize of output 12 [2018-11-14 17:55:04,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 17:55:04,319 INFO L477 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 23 treesize of output 18 [2018-11-14 17:55:04,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:55:04,340 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-11-14 17:55:04,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,375 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-14 17:55:04,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-14 17:55:04,396 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:04,483 INFO L477 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 15 treesize of output 11 [2018-11-14 17:55:04,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 17:55:04,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,503 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-14 17:55:04,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-14 17:55:04,509 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:04,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-14 17:55:04,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {866#true} is VALID [2018-11-14 17:55:04,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-14 17:55:04,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #76#return; {866#true} is VALID [2018-11-14 17:55:04,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret7 := main(); {866#true} is VALID [2018-11-14 17:55:04,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {866#true} is VALID [2018-11-14 17:55:04,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {866#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {889#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:04,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {889#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {893#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:04,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {893#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {893#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:04,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {893#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {893#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:04,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {893#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {903#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:04,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {903#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {903#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:04,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {903#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {910#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:04,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {910#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {910#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:04,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {910#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {910#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:04,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {910#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {910#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:04,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {910#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {923#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:04,635 INFO L273 TraceCheckUtils]: 17: Hoare triple {923#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {923#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:04,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {923#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {930#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:04,638 INFO L256 TraceCheckUtils]: 19: Hoare triple {930#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {934#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:04,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {934#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {938#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:04,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {938#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {867#false} is VALID [2018-11-14 17:55:04,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-14 17:55:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:04,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:55:04,903 INFO L477 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 16 treesize of output 14 [2018-11-14 17:55:04,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 [2018-11-14 17:55:04,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:55:04,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:55:04,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:10 [2018-11-14 17:55:04,969 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:05,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-14 17:55:05,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {948#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {867#false} is VALID [2018-11-14 17:55:05,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {952#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {948#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:55:05,088 INFO L256 TraceCheckUtils]: 19: Hoare triple {956#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {952#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:55:05,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {960#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {956#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-14 17:55:05,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {960#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {960#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:05,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0bv32; {960#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:05,097 INFO L273 TraceCheckUtils]: 15: Hoare triple {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:05,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume true; {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:05,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:05,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:05,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:05,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {986#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {967#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:05,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {986#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {986#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:05,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {986#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume true; {986#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:05,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {996#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {986#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:05,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {866#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {996#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-14 17:55:05,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {866#true} is VALID [2018-11-14 17:55:05,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret7 := main(); {866#true} is VALID [2018-11-14 17:55:05,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #76#return; {866#true} is VALID [2018-11-14 17:55:05,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-14 17:55:05,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {866#true} is VALID [2018-11-14 17:55:05,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-14 17:55:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 17:55:05,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:55:05,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-14 17:55:05,117 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-14 17:55:05,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:05,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:55:05,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:05,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:55:05,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:55:05,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:55:05,248 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 17 states. [2018-11-14 17:55:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:10,263 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-11-14 17:55:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:55:10,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-14 17:55:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:55:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:55:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2018-11-14 17:55:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:55:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2018-11-14 17:55:10,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 80 transitions. [2018-11-14 17:55:10,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:10,555 INFO L225 Difference]: With dead ends: 82 [2018-11-14 17:55:10,555 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 17:55:10,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:55:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 17:55:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 35. [2018-11-14 17:55:10,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:55:10,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 35 states. [2018-11-14 17:55:10,666 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 35 states. [2018-11-14 17:55:10,666 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 35 states. [2018-11-14 17:55:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:10,670 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-14 17:55:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-14 17:55:10,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:10,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:10,672 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 80 states. [2018-11-14 17:55:10,672 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 80 states. [2018-11-14 17:55:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:10,676 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-14 17:55:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-14 17:55:10,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:10,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:10,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:55:10,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:55:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:55:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-14 17:55:10,680 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 23 [2018-11-14 17:55:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:55:10,680 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-14 17:55:10,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:55:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:55:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:55:10,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:10,681 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-14 17:55:10,681 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:10,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:10,682 INFO L82 PathProgramCache]: Analyzing trace with hash 955157426, now seen corresponding path program 1 times [2018-11-14 17:55:10,682 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:10,682 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:55:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:55:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:10,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:10,840 INFO L477 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 13 treesize of output 10 [2018-11-14 17:55:10,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 17:55:10,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:10,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:10,869 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-14 17:55:10,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-14 17:55:10,879 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:11,059 INFO L477 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 16 treesize of output 12 [2018-11-14 17:55:11,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-14 17:55:11,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:11,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:11,091 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-14 17:55:11,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-14 17:55:11,096 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:11,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2018-11-14 17:55:11,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {1354#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1354#true} is VALID [2018-11-14 17:55:11,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {1354#true} assume true; {1354#true} is VALID [2018-11-14 17:55:11,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1354#true} {1354#true} #76#return; {1354#true} is VALID [2018-11-14 17:55:11,185 INFO L256 TraceCheckUtils]: 4: Hoare triple {1354#true} call #t~ret7 := main(); {1354#true} is VALID [2018-11-14 17:55:11,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {1354#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1354#true} is VALID [2018-11-14 17:55:11,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {1354#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1377#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {1377#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:11,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:11,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:11,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:11,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:11,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {1381#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {1397#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {1397#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1397#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {1397#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {1397#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {1397#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {1397#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {1397#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,232 INFO L256 TraceCheckUtils]: 19: Hoare triple {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1420#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 17:55:11,233 INFO L273 TraceCheckUtils]: 20: Hoare triple {1420#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} ~cond := #in~cond; {1420#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 17:55:11,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {1420#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} assume !(~cond == 0bv32); {1420#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 17:55:11,235 INFO L273 TraceCheckUtils]: 22: Hoare triple {1420#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} assume true; {1420#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 17:55:11,236 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1420#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #74#return; {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem6; {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {1410#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1439#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:11,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {1439#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1439#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:11,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {1439#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1446#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:11,241 INFO L256 TraceCheckUtils]: 28: Hoare triple {1446#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1450#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:11,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {1450#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1454#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:11,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {1454#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1355#false} is VALID [2018-11-14 17:55:11,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2018-11-14 17:55:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:11,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:55:11,550 INFO L477 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 18 treesize of output 16 [2018-11-14 17:55:11,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 7 [2018-11-14 17:55:11,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:11,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:11,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:11,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-14 17:55:11,632 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:11,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2018-11-14 17:55:11,722 INFO L273 TraceCheckUtils]: 30: Hoare triple {1464#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1355#false} is VALID [2018-11-14 17:55:11,735 INFO L273 TraceCheckUtils]: 29: Hoare triple {1468#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1464#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:55:11,748 INFO L256 TraceCheckUtils]: 28: Hoare triple {1472#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1468#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:55:11,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {1476#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1472#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-14 17:55:11,774 INFO L273 TraceCheckUtils]: 26: Hoare triple {1476#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {1476#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:11,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1476#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:11,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem6; {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:11,997 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1354#true} {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #74#return; {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:11,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {1354#true} assume true; {1354#true} is VALID [2018-11-14 17:55:11,997 INFO L273 TraceCheckUtils]: 21: Hoare triple {1354#true} assume !(~cond == 0bv32); {1354#true} is VALID [2018-11-14 17:55:11,997 INFO L273 TraceCheckUtils]: 20: Hoare triple {1354#true} ~cond := #in~cond; {1354#true} is VALID [2018-11-14 17:55:11,997 INFO L256 TraceCheckUtils]: 19: Hoare triple {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1354#true} is VALID [2018-11-14 17:55:11,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:12,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume true; {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:12,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {1511#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} ~i~0 := 0bv32; {1483#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:12,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {1511#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {1511#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:12,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {1511#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume true; {1511#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:12,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {1511#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1511#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:12,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {1511#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:12,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:12,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:12,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:12,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume true; {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:12,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {1354#true} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {1524#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:12,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {1354#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1354#true} is VALID [2018-11-14 17:55:12,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {1354#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1354#true} is VALID [2018-11-14 17:55:12,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {1354#true} call #t~ret7 := main(); {1354#true} is VALID [2018-11-14 17:55:12,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1354#true} {1354#true} #76#return; {1354#true} is VALID [2018-11-14 17:55:12,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {1354#true} assume true; {1354#true} is VALID [2018-11-14 17:55:12,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {1354#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1354#true} is VALID [2018-11-14 17:55:12,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2018-11-14 17:55:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:12,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:55:12,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-11-14 17:55:12,066 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-11-14 17:55:12,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:12,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:55:12,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:12,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:55:12,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:55:12,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:55:12,519 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 18 states. [2018-11-14 17:55:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:40,181 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-14 17:55:40,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:55:40,181 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-11-14 17:55:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:55:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:55:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-14 17:55:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:55:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-14 17:55:40,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 76 transitions. [2018-11-14 17:55:40,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:40,400 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:55:40,401 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:55:40,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:55:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:55:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 51. [2018-11-14 17:55:40,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:55:40,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 51 states. [2018-11-14 17:55:40,516 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 51 states. [2018-11-14 17:55:40,517 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 51 states. [2018-11-14 17:55:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:40,520 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-14 17:55:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-11-14 17:55:40,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:40,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:40,521 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 76 states. [2018-11-14 17:55:40,522 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 76 states. [2018-11-14 17:55:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:40,525 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-14 17:55:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-11-14 17:55:40,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:40,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:40,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:55:40,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:55:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 17:55:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-14 17:55:40,528 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 32 [2018-11-14 17:55:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:55:40,529 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-14 17:55:40,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:55:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-14 17:55:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:55:40,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:40,530 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-14 17:55:40,530 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:40,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash 137508976, now seen corresponding path program 1 times [2018-11-14 17:55:40,531 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:40,531 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:55:40,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:55:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:40,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:40,734 INFO L477 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 13 treesize of output 10 [2018-11-14 17:55:40,739 INFO L477 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 10 treesize of output 9 [2018-11-14 17:55:40,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:40,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:40,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:40,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-14 17:55:41,004 INFO L477 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 15 treesize of output 11 [2018-11-14 17:55:41,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 17:55:41,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:41,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:41,021 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-14 17:55:41,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-14 17:55:41,026 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:41,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2018-11-14 17:55:41,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {1890#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1890#true} is VALID [2018-11-14 17:55:41,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2018-11-14 17:55:41,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #76#return; {1890#true} is VALID [2018-11-14 17:55:41,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret7 := main(); {1890#true} is VALID [2018-11-14 17:55:41,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {1890#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1890#true} is VALID [2018-11-14 17:55:41,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {1890#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1913#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {1913#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {1917#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {1933#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {1933#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1933#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {1933#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {1933#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {1933#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {1933#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {1933#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,098 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,100 INFO L256 TraceCheckUtils]: 19: Hoare triple {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {1956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {1956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {1956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume !(~cond == 0bv32); {1956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {1956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,103 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #74#return; {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,104 INFO L273 TraceCheckUtils]: 24: Hoare triple {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem6; {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,105 INFO L273 TraceCheckUtils]: 25: Hoare triple {1946#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1975#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {1975#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1975#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:41,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {1975#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1982#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:41,109 INFO L256 TraceCheckUtils]: 28: Hoare triple {1982#(and (= (_ bv10 32) |main_#t~mem6|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1986#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:41,110 INFO L273 TraceCheckUtils]: 29: Hoare triple {1986#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1990#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:41,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {1990#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1891#false} is VALID [2018-11-14 17:55:41,111 INFO L273 TraceCheckUtils]: 31: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2018-11-14 17:55:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:41,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:55:41,392 INFO L477 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 18 treesize of output 16 [2018-11-14 17:55:41,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 7 [2018-11-14 17:55:41,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:41,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:55:41,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:55:41,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-11-14 17:55:41,464 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:41,602 INFO L273 TraceCheckUtils]: 31: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2018-11-14 17:55:41,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {2000#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1891#false} is VALID [2018-11-14 17:55:41,604 INFO L273 TraceCheckUtils]: 29: Hoare triple {2004#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2000#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:55:41,606 INFO L256 TraceCheckUtils]: 28: Hoare triple {2008#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2004#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:55:41,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {2012#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2008#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-14 17:55:41,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {2012#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {2012#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:41,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2012#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:41,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem6; {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:41,801 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1890#true} {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #74#return; {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:41,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {1890#true} assume true; {1890#true} is VALID [2018-11-14 17:55:41,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {1890#true} assume !(~cond == 0bv32); {1890#true} is VALID [2018-11-14 17:55:41,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {1890#true} ~cond := #in~cond; {1890#true} is VALID [2018-11-14 17:55:41,802 INFO L256 TraceCheckUtils]: 19: Hoare triple {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1890#true} is VALID [2018-11-14 17:55:41,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:41,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume true; {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:41,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {2047#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} ~i~0 := 0bv32; {2019#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:41,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {2047#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {2047#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:41,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {2047#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume true; {2047#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:41,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {2047#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2047#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:41,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {2047#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:41,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:41,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:41,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:41,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume true; {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:41,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {2076#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {2060#(and (= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:41,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {1890#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {2076#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-14 17:55:41,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {1890#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1890#true} is VALID [2018-11-14 17:55:41,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret7 := main(); {1890#true} is VALID [2018-11-14 17:55:41,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #76#return; {1890#true} is VALID [2018-11-14 17:55:41,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2018-11-14 17:55:41,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {1890#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1890#true} is VALID [2018-11-14 17:55:41,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2018-11-14 17:55:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:41,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:55:41,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-14 17:55:41,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-14 17:55:41,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:41,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:55:42,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:42,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:55:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:55:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:55:42,254 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 19 states. [2018-11-14 17:55:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:48,556 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-14 17:55:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:55:48,557 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-14 17:55:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:55:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:55:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2018-11-14 17:55:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:55:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2018-11-14 17:55:48,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 92 transitions. [2018-11-14 17:55:50,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 91 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:50,839 INFO L225 Difference]: With dead ends: 112 [2018-11-14 17:55:50,839 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 17:55:50,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:55:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 17:55:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 44. [2018-11-14 17:55:50,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:55:50,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 44 states. [2018-11-14 17:55:50,934 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 44 states. [2018-11-14 17:55:50,934 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 44 states. [2018-11-14 17:55:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:50,939 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-11-14 17:55:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-11-14 17:55:50,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:50,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:50,940 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 110 states. [2018-11-14 17:55:50,940 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 110 states. [2018-11-14 17:55:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:50,945 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-11-14 17:55:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-11-14 17:55:50,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:50,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:50,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:55:50,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:55:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:55:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-14 17:55:50,948 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 32 [2018-11-14 17:55:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:55:50,948 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-14 17:55:50,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:55:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 17:55:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:55:50,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:50,949 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:55:50,949 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:50,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:50,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1949254806, now seen corresponding path program 2 times [2018-11-14 17:55:50,950 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:50,950 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:55:50,976 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:55:51,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:55:51,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:55:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:51,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:51,485 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-14 17:55:51,727 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-14 17:55:52,026 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-14 17:55:52,337 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-14 17:55:52,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2018-11-14 17:55:52,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2549#true} is VALID [2018-11-14 17:55:52,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {2549#true} assume true; {2549#true} is VALID [2018-11-14 17:55:52,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2549#true} {2549#true} #76#return; {2549#true} is VALID [2018-11-14 17:55:52,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {2549#true} call #t~ret7 := main(); {2549#true} is VALID [2018-11-14 17:55:52,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {2549#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2549#true} is VALID [2018-11-14 17:55:52,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {2549#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {2572#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-14 17:55:52,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {2572#(bvsgt ~SIZE~0 (_ bv1 32))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {2576#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2595#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 17:55:52,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {2595#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {2595#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 17:55:52,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {2595#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,373 INFO L256 TraceCheckUtils]: 19: Hoare triple {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(~cond == 0bv32); {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,377 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #74#return; {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} havoc #t~mem6; {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {2606#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,382 INFO L256 TraceCheckUtils]: 28: Hoare triple {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(~cond == 0bv32); {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 17:55:52,393 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2602#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)))} {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #74#return; {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem6; {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:52,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {2634#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2662#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 17:55:52,394 INFO L273 TraceCheckUtils]: 35: Hoare triple {2662#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {2662#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 17:55:52,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {2662#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (not (bvsle (_ bv2 32) (bvsdiv ~SIZE~0 (_ bv2 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2550#false} is VALID [2018-11-14 17:55:52,414 INFO L256 TraceCheckUtils]: 37: Hoare triple {2550#false} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2550#false} is VALID [2018-11-14 17:55:52,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2018-11-14 17:55:52,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {2550#false} assume ~cond == 0bv32; {2550#false} is VALID [2018-11-14 17:55:52,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2018-11-14 17:55:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:55:52,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:55:54,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2018-11-14 17:55:54,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {2550#false} assume ~cond == 0bv32; {2550#false} is VALID [2018-11-14 17:55:54,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2018-11-14 17:55:54,280 INFO L256 TraceCheckUtils]: 37: Hoare triple {2550#false} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2550#false} is VALID [2018-11-14 17:55:54,280 INFO L273 TraceCheckUtils]: 36: Hoare triple {2693#(not (bvslt main_~i~0 ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2550#false} is VALID [2018-11-14 17:55:54,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {2693#(not (bvslt main_~i~0 ~SIZE~0))} assume true; {2693#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 17:55:54,282 INFO L273 TraceCheckUtils]: 34: Hoare triple {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2693#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 17:55:54,282 INFO L273 TraceCheckUtils]: 33: Hoare triple {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} havoc #t~mem6; {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,283 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2549#true} {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #74#return; {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {2549#true} assume true; {2549#true} is VALID [2018-11-14 17:55:54,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {2549#true} assume !(~cond == 0bv32); {2549#true} is VALID [2018-11-14 17:55:54,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2018-11-14 17:55:54,283 INFO L256 TraceCheckUtils]: 28: Hoare triple {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2549#true} is VALID [2018-11-14 17:55:54,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2700#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,308 INFO L273 TraceCheckUtils]: 24: Hoare triple {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} havoc #t~mem6; {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,309 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #74#return; {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2018-11-14 17:55:54,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(~cond == 0bv32); {2549#true} is VALID [2018-11-14 17:55:54,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2018-11-14 17:55:54,310 INFO L256 TraceCheckUtils]: 19: Hoare triple {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2549#true} is VALID [2018-11-14 17:55:54,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume true; {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {2756#(not (bvslt (_ bv2 32) ~SIZE~0))} ~i~0 := 0bv32; {2728#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 17:55:54,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {2760#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {2756#(not (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-14 17:55:54,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {2760#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32))))} assume true; {2760#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32))))} is VALID [2018-11-14 17:55:54,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {2767#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2760#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32))))} is VALID [2018-11-14 17:55:54,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {2767#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {2767#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-14 17:55:54,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {2767#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2767#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-14 17:55:54,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {2767#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {2767#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-14 17:55:54,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {2780#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)) (not (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32)))))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2767#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-14 17:55:54,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {2780#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)) (not (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32)))))} assume true; {2780#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)) (not (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32)))))} is VALID [2018-11-14 17:55:54,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {2549#true} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {2780#(or (bvsle (bvadd main_~i~0 (_ bv1 32)) (bvsdiv ~SIZE~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~SIZE~0)) (not (bvsle main_~i~0 (bvsdiv ~SIZE~0 (_ bv2 32)))))} is VALID [2018-11-14 17:55:54,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {2549#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {2549#true} is VALID [2018-11-14 17:55:54,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {2549#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2549#true} is VALID [2018-11-14 17:55:54,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {2549#true} call #t~ret7 := main(); {2549#true} is VALID [2018-11-14 17:55:54,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2549#true} {2549#true} #76#return; {2549#true} is VALID [2018-11-14 17:55:54,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {2549#true} assume true; {2549#true} is VALID [2018-11-14 17:55:54,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2549#true} is VALID [2018-11-14 17:55:54,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2018-11-14 17:55:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:55:54,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:55:54,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 17:55:54,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-11-14 17:55:54,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:54,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:55:54,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:54,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:55:54,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:55:54,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:55:54,932 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 16 states. [2018-11-14 17:55:59,018 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-14 17:55:59,741 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-14 17:56:00,461 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-14 17:56:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:56:04,782 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-14 17:56:04,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:56:04,782 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-11-14 17:56:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:56:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:56:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2018-11-14 17:56:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:56:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2018-11-14 17:56:04,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 87 transitions. [2018-11-14 17:56:05,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:56:05,601 INFO L225 Difference]: With dead ends: 88 [2018-11-14 17:56:05,601 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 17:56:05,602 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:56:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 17:56:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-11-14 17:56:05,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:56:05,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 50 states. [2018-11-14 17:56:05,902 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 50 states. [2018-11-14 17:56:05,902 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 50 states. [2018-11-14 17:56:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:56:05,904 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-14 17:56:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-14 17:56:05,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:56:05,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:56:05,905 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 56 states. [2018-11-14 17:56:05,905 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 56 states. [2018-11-14 17:56:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:56:05,907 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-14 17:56:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-14 17:56:05,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:56:05,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:56:05,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:56:05,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:56:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:56:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-14 17:56:05,909 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 41 [2018-11-14 17:56:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:56:05,909 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-14 17:56:05,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:56:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-14 17:56:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 17:56:05,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:56:05,910 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:56:05,910 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:56:05,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:56:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1445799767, now seen corresponding path program 3 times [2018-11-14 17:56:05,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:56:05,911 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:56:05,928 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:56:06,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 17:56:06,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:56:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:56:06,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:56:06,209 INFO L477 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 16 treesize of output 13 [2018-11-14 17:56:06,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 17:56:06,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:56:06,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:06,258 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-14 17:56:06,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-14 17:56:06,271 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:56:06,337 INFO L477 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 24 treesize of output 19 [2018-11-14 17:56:06,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:56:06,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-14 17:56:06,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:56:06,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:06,395 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-14 17:56:06,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-14 17:56:06,417 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:56:06,740 INFO L477 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 20 treesize of output 16 [2018-11-14 17:56:06,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-14 17:56:06,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:56:06,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:06,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:06,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2018-11-14 17:56:06,769 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:56:06,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {3108#true} call ULTIMATE.init(); {3108#true} is VALID [2018-11-14 17:56:06,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {3108#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3108#true} is VALID [2018-11-14 17:56:06,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {3108#true} assume true; {3108#true} is VALID [2018-11-14 17:56:06,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3108#true} {3108#true} #76#return; {3108#true} is VALID [2018-11-14 17:56:06,860 INFO L256 TraceCheckUtils]: 4: Hoare triple {3108#true} call #t~ret7 := main(); {3108#true} is VALID [2018-11-14 17:56:06,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {3108#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3108#true} is VALID [2018-11-14 17:56:06,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {3108#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {3131#(= main_~DEFAULTVAL~0 (_ bv0 32))} is VALID [2018-11-14 17:56:06,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {3131#(= main_~DEFAULTVAL~0 (_ bv0 32))} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {3135#(and (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3154#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {3154#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {3154#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {3154#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3154#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {3154#(and (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3164#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,920 INFO L273 TraceCheckUtils]: 17: Hoare triple {3164#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3164#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {3164#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3171#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {3171#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3171#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {3171#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {3171#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {3171#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {3171#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {3171#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,928 INFO L256 TraceCheckUtils]: 25: Hoare triple {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} is VALID [2018-11-14 17:56:06,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} ~cond := #in~cond; {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} is VALID [2018-11-14 17:56:06,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} assume !(~cond == 0bv32); {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} is VALID [2018-11-14 17:56:06,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} assume true; {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} is VALID [2018-11-14 17:56:06,932 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #74#return; {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem6; {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,935 INFO L273 TraceCheckUtils]: 31: Hoare triple {3184#(and (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,936 INFO L273 TraceCheckUtils]: 32: Hoare triple {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,937 INFO L273 TraceCheckUtils]: 33: Hoare triple {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,940 INFO L256 TraceCheckUtils]: 34: Hoare triple {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} is VALID [2018-11-14 17:56:06,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} ~cond := #in~cond; {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} is VALID [2018-11-14 17:56:06,941 INFO L273 TraceCheckUtils]: 36: Hoare triple {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} assume !(~cond == 0bv32); {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} is VALID [2018-11-14 17:56:06,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} assume true; {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} is VALID [2018-11-14 17:56:06,942 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3194#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv8 32))))))} {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #74#return; {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,943 INFO L273 TraceCheckUtils]: 39: Hoare triple {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem6; {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:06,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {3213#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3164#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {3164#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {3164#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {3164#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32))) main_~DEFAULTVAL~0)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3247#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:06,948 INFO L256 TraceCheckUtils]: 43: Hoare triple {3247#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem6|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3251#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:06,949 INFO L273 TraceCheckUtils]: 44: Hoare triple {3251#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3255#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:06,950 INFO L273 TraceCheckUtils]: 45: Hoare triple {3255#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {3109#false} is VALID [2018-11-14 17:56:06,950 INFO L273 TraceCheckUtils]: 46: Hoare triple {3109#false} assume !false; {3109#false} is VALID [2018-11-14 17:56:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:56:06,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:56:07,386 INFO L477 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 18 treesize of output 16 [2018-11-14 17:56:07,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 5 [2018-11-14 17:56:07,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:56:07,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:07,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:07,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:22, output treesize:5 [2018-11-14 17:56:07,466 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:56:07,579 INFO L273 TraceCheckUtils]: 46: Hoare triple {3109#false} assume !false; {3109#false} is VALID [2018-11-14 17:56:07,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {3265#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {3109#false} is VALID [2018-11-14 17:56:07,586 INFO L273 TraceCheckUtils]: 44: Hoare triple {3269#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3265#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:56:07,588 INFO L256 TraceCheckUtils]: 43: Hoare triple {3273#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3269#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:56:07,589 INFO L273 TraceCheckUtils]: 42: Hoare triple {3277#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3273#(not (= main_~DEFAULTVAL~0 |main_#t~mem6|))} is VALID [2018-11-14 17:56:07,590 INFO L273 TraceCheckUtils]: 41: Hoare triple {3277#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {3277#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:56:07,787 INFO L273 TraceCheckUtils]: 40: Hoare triple {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3277#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:56:07,787 INFO L273 TraceCheckUtils]: 39: Hoare triple {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem6; {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:07,788 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3108#true} {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #74#return; {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:07,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {3108#true} assume true; {3108#true} is VALID [2018-11-14 17:56:07,789 INFO L273 TraceCheckUtils]: 36: Hoare triple {3108#true} assume !(~cond == 0bv32); {3108#true} is VALID [2018-11-14 17:56:07,789 INFO L273 TraceCheckUtils]: 35: Hoare triple {3108#true} ~cond := #in~cond; {3108#true} is VALID [2018-11-14 17:56:07,789 INFO L256 TraceCheckUtils]: 34: Hoare triple {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3108#true} is VALID [2018-11-14 17:56:07,790 INFO L273 TraceCheckUtils]: 33: Hoare triple {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:07,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume true; {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:08,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3284#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:08,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} havoc #t~mem6; {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,145 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {3108#true} {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #74#return; {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {3108#true} assume true; {3108#true} is VALID [2018-11-14 17:56:08,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {3108#true} assume !(~cond == 0bv32); {3108#true} is VALID [2018-11-14 17:56:08,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {3108#true} ~cond := #in~cond; {3108#true} is VALID [2018-11-14 17:56:08,145 INFO L256 TraceCheckUtils]: 25: Hoare triple {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} call __VERIFIER_assert((if #t~mem6 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3108#true} is VALID [2018-11-14 17:56:08,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} assume true; {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,149 INFO L273 TraceCheckUtils]: 22: Hoare triple {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} ~i~0 := 0bv32; {3312#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume true; {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,152 INFO L273 TraceCheckUtils]: 19: Hoare triple {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {3359#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3340#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-14 17:56:08,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {3359#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3359#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-14 17:56:08,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {3359#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} assume true; {3359#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-14 17:56:08,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3359#(= (_ bv16 32) (bvmul (_ bv8 32) main_~i~0))} is VALID [2018-11-14 17:56:08,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:08,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:08,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:08,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:08,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} assume true; {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:08,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {3108#true} assume !(~bvsrem32(~SIZE~0, 2bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 2bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {3369#(= (bvadd (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:08,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {3108#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {3108#true} is VALID [2018-11-14 17:56:08,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {3108#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3108#true} is VALID [2018-11-14 17:56:08,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {3108#true} call #t~ret7 := main(); {3108#true} is VALID [2018-11-14 17:56:08,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3108#true} {3108#true} #76#return; {3108#true} is VALID [2018-11-14 17:56:08,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {3108#true} assume true; {3108#true} is VALID [2018-11-14 17:56:08,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {3108#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3108#true} is VALID [2018-11-14 17:56:08,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {3108#true} call ULTIMATE.init(); {3108#true} is VALID [2018-11-14 17:56:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:56:08,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:56:08,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-14 17:56:08,177 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-11-14 17:56:08,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:56:08,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:56:09,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:56:09,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:56:09,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:56:09,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:56:09,015 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 22 states.