java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/pnr4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:28:56,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:28:56,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:28:56,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:28:56,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:28:56,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:28:56,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:28:56,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:28:56,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:28:56,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:28:56,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:28:56,553 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:28:56,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:28:56,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:28:56,556 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:28:56,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:28:56,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:28:56,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:28:56,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:28:56,564 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:28:56,565 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:28:56,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:28:56,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:28:56,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:28:56,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:28:56,571 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:28:56,572 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:28:56,573 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:28:56,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:28:56,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:28:56,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:28:56,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:28:56,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:28:56,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:28:56,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:28:56,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:28:56,578 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:28:56,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:28:56,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:28:56,594 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:28:56,594 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:28:56,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:28:56,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:28:56,595 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:28:56,596 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:28:56,596 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:28:56,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:28:56,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:28:56,596 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:28:56,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:28:56,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:28:56,597 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:28:56,597 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:28:56,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:28:56,598 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:28:56,598 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:28:56,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:28:56,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:28:56,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:28:56,599 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:28:56,599 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:28:56,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:28:56,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:28:56,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:28:56,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:28:56,600 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:28:56,600 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:28:56,600 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:28:56,600 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:28:56,600 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:28:56,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:28:56,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:28:56,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:28:56,666 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:28:56,666 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:28:56,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr4_true-unreach-call.i [2018-11-23 10:28:56,749 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b207ebf02/f9f1420d9c5d418d81e1b8a575fd1618/FLAG3d55c2e54 [2018-11-23 10:28:57,162 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:28:57,162 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr4_true-unreach-call.i [2018-11-23 10:28:57,170 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b207ebf02/f9f1420d9c5d418d81e1b8a575fd1618/FLAG3d55c2e54 [2018-11-23 10:28:57,533 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b207ebf02/f9f1420d9c5d418d81e1b8a575fd1618 [2018-11-23 10:28:57,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:28:57,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:28:57,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:28:57,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:28:57,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:28:57,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:57,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1065b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57, skipping insertion in model container [2018-11-23 10:28:57,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:57,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:28:57,602 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:28:57,898 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:28:57,905 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:28:57,943 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:28:57,970 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:28:57,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57 WrapperNode [2018-11-23 10:28:57,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:28:57,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:28:57,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:28:57,972 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:28:57,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:57,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:58,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:28:58,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:28:58,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:28:58,008 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:28:58,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:58,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:58,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:58,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:58,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:58,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:58,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... [2018-11-23 10:28:58,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:28:58,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:28:58,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:28:58,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:28:58,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:28:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:28:58,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:28:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:28:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:28:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2018-11-23 10:28:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:28:58,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:28:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:28:58,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:28:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:28:58,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:28:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:28:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:28:58,988 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:28:58,989 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:28:58,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:58 BoogieIcfgContainer [2018-11-23 10:28:58,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:28:58,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:28:58,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:28:58,994 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:28:58,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:28:57" (1/3) ... [2018-11-23 10:28:58,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6454e23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:58, skipping insertion in model container [2018-11-23 10:28:58,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57" (2/3) ... [2018-11-23 10:28:58,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6454e23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:58, skipping insertion in model container [2018-11-23 10:28:58,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:58" (3/3) ... [2018-11-23 10:28:58,998 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr4_true-unreach-call.i [2018-11-23 10:28:59,010 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:28:59,019 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:28:59,039 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:28:59,075 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:28:59,075 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:28:59,076 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:28:59,076 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:28:59,078 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:28:59,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:28:59,078 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:28:59,079 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:28:59,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:28:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 10:28:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:28:59,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:28:59,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:28:59,110 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:28:59,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:28:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash -861869254, now seen corresponding path program 1 times [2018-11-23 10:28:59,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:28:59,123 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:28:59,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:28:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:28:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:28:59,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:28:59,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 10:28:59,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {37#true} is VALID [2018-11-23 10:28:59,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 10:28:59,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #86#return; {37#true} is VALID [2018-11-23 10:28:59,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret9 := main(); {37#true} is VALID [2018-11-23 10:28:59,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2018-11-23 10:28:59,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#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; {37#true} is VALID [2018-11-23 10:28:59,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {37#true} is VALID [2018-11-23 10:28:59,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-23 10:28:59,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0bv32; {38#false} is VALID [2018-11-23 10:28:59,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {38#false} is VALID [2018-11-23 10:28:59,543 INFO L256 TraceCheckUtils]: 11: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {38#false} is VALID [2018-11-23 10:28:59,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-23 10:28:59,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume 0bv32 == ~cond; {38#false} is VALID [2018-11-23 10:28:59,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 10:28:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:28:59,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:28:59,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:28:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:28:59,559 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:28:59,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:28:59,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:28:59,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:28:59,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:28:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:28:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:28:59,693 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 10:29:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:00,068 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 10:29:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:29:00,068 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:29:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-23 10:29:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-23 10:29:00,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2018-11-23 10:29:00,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:00,337 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:29:00,337 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:29:00,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:29:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:29:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 10:29:00,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:00,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 10:29:00,399 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:29:00,400 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:29:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:00,405 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 10:29:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 10:29:00,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:00,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:00,406 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:29:00,406 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:29:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:00,411 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 10:29:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 10:29:00,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:00,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:00,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:00,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:29:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 10:29:00,418 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 15 [2018-11-23 10:29:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:00,419 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 10:29:00,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:29:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 10:29:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:29:00,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:00,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:00,421 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:00,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:00,421 INFO L82 PathProgramCache]: Analyzing trace with hash 802784026, now seen corresponding path program 1 times [2018-11-23 10:29:00,424 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:00,425 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:00,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:00,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:00,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-23 10:29:00,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {237#true} is VALID [2018-11-23 10:29:00,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-23 10:29:00,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #86#return; {237#true} is VALID [2018-11-23 10:29:00,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret9 := main(); {237#true} is VALID [2018-11-23 10:29:00,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {237#true} is VALID [2018-11-23 10:29:00,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {237#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; {260#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:00,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {260#(bvsgt ~SIZE~0 (_ bv1 32))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {264#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv0 32) (bvsrem ~SIZE~0 (_ bv4 32))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:00,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {264#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv0 32) (bvsrem ~SIZE~0 (_ bv4 32))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {238#false} is VALID [2018-11-23 10:29:00,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {238#false} ~i~0 := 0bv32; {238#false} is VALID [2018-11-23 10:29:00,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {238#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {238#false} is VALID [2018-11-23 10:29:00,807 INFO L256 TraceCheckUtils]: 11: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {238#false} is VALID [2018-11-23 10:29:00,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-23 10:29:00,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {238#false} assume 0bv32 == ~cond; {238#false} is VALID [2018-11-23 10:29:00,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-23 10:29:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:00,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:29:00,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:00,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:29:00,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 10:29:00,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:00,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:29:01,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:01,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:29:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:29:01,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:29:01,011 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 10:29:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:01,817 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 10:29:01,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:29:01,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 10:29:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:29:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 10:29:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:29:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 10:29:01,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 10:29:02,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:02,052 INFO L225 Difference]: With dead ends: 48 [2018-11-23 10:29:02,053 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:29:02,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-23 10:29:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:29:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-11-23 10:29:02,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:02,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 29 states. [2018-11-23 10:29:02,066 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 29 states. [2018-11-23 10:29:02,066 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 29 states. [2018-11-23 10:29:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:02,071 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 10:29:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 10:29:02,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:02,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:02,072 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 37 states. [2018-11-23 10:29:02,073 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 37 states. [2018-11-23 10:29:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:02,076 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 10:29:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 10:29:02,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:02,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:02,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:02,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 10:29:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 10:29:02,080 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2018-11-23 10:29:02,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:02,081 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 10:29:02,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:29:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 10:29:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:29:02,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:02,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:02,083 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:02,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:02,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1524708290, now seen corresponding path program 1 times [2018-11-23 10:29:02,084 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:02,084 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:02,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:02,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:02,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 10:29:02,533 INFO L478 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-23 10:29:02,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-23 10:29:02,624 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:02,625 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= (store |v_#memory_int_20| |main_~#a~0.base| (store (select |v_#memory_int_20| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:29:02,625 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:29:02,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-23 10:29:02,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:02,787 INFO L478 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 25 treesize of output 40 [2018-11-23 10:29:02,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-23 10:29:02,859 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:02,859 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, main_~FIXEDVAL~0]. (let ((.cse0 (select |v_#memory_int_21| |main_~#a~0.base|)) (.cse1 (bvmul (_ bv16 32) main_~i~0))) (and (= (store |v_#memory_int_21| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967284 32)) main_~FIXEDVAL~0)) |#memory_int|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967280 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 10:29:02,859 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:29:02,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-23 10:29:02,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:02,951 INFO L478 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 25 treesize of output 40 [2018-11-23 10:29:02,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:02,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-23 10:29:03,012 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:03,013 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_22| |main_~#a~0.base|)) (.cse1 (bvmul (_ bv16 32) main_~i~0))) (and (not (= main_~DEFAULTVAL~0 (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967280 32))))) (= (store |v_#memory_int_22| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967288 32)) main_~value~0)) |#memory_int|) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 10:29:03,013 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:29:03,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-23 10:29:03,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:03,068 INFO L478 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-23 10:29:03,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-11-23 10:29:03,169 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:03,170 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_23| |main_~#a~0.base|))) (and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select .cse0 |main_~#a~0.offset|))) (= (store |v_#memory_int_23| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| (_ bv12 32)) main_~value~0)) |#memory_int|) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:03,170 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (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))) [2018-11-23 10:29:03,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 10:29:03,279 INFO L478 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-23 10:29:03,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-23 10:29:03,303 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:03,304 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv0 32)))) (and (= .cse0 |main_#t~mem8|) (not (= main_~DEFAULTVAL~0 .cse0)) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:03,304 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:03,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-23 10:29:03,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {457#true} is VALID [2018-11-23 10:29:03,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 10:29:03,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #86#return; {457#true} is VALID [2018-11-23 10:29:03,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret9 := main(); {457#true} is VALID [2018-11-23 10:29:03,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {457#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {457#true} is VALID [2018-11-23 10:29:03,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#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; {480#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:03,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {480#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {484#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(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, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {484#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(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(4bv32, ~i~0), 4bv32))), 4bv32); {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |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; {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |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(4bv32, ~i~0), 3bv32))), 4bv32); {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |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(4bv32, ~i~0), 2bv32))), 4bv32); {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:03,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {491#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~DEFAULTVAL~0)) (= |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(4bv32, ~i~0), 1bv32))), 4bv32); {510#(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-23 10:29:03,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {510#(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; {510#(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-23 10:29:03,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {510#(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, 4bv32)); {510#(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-23 10:29:03,413 INFO L273 TraceCheckUtils]: 18: Hoare triple {510#(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; {520#(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-23 10:29:03,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {520#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {524#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:03,417 INFO L256 TraceCheckUtils]: 20: Hoare triple {524#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {528#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:03,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {528#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {532#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:03,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {532#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {458#false} is VALID [2018-11-23 10:29:03,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-23 10:29:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:03,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:03,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-23 10:29:03,842 INFO L478 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-23 10:29:03,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:03,861 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-23 10:29:03,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-23 10:29:03,866 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:03,867 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, main_~value~0]. (or (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) main_~value~0) |main_~#a~0.offset|) main_~DEFAULTVAL~0)) (= main_~value~0 main_~DEFAULTVAL~0)) [2018-11-23 10:29:03,867 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) [2018-11-23 10:29:03,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-23 10:29:03,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {542#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {458#false} is VALID [2018-11-23 10:29:03,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {546#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {542#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:03,909 INFO L256 TraceCheckUtils]: 20: Hoare triple {550#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {546#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:03,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {554#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {550#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 10:29:03,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0bv32; {554#(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-23 10:29:03,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,912 INFO L273 TraceCheckUtils]: 16: Hoare triple {558#(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; {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {558#(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(4bv32, ~i~0), 1bv32))), 4bv32); {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {558#(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(4bv32, ~i~0), 2bv32))), 4bv32); {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 3bv32))), 4bv32); {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {558#(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; {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#(= (_ bv16 32) (bvmul (_ bv16 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(4bv32, ~i~0), 4bv32))), 4bv32); {558#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:03,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {586#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:29:03,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {457#true} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {586#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:29:03,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#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; {457#true} is VALID [2018-11-23 10:29:03,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {457#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {457#true} is VALID [2018-11-23 10:29:03,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret9 := main(); {457#true} is VALID [2018-11-23 10:29:03,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #86#return; {457#true} is VALID [2018-11-23 10:29:03,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 10:29:03,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {457#true} is VALID [2018-11-23 10:29:03,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-23 10:29:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:03,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:03,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-23 10:29:03,943 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-11-23 10:29:03,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:03,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:29:04,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:04,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:29:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:29:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:29:04,073 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 16 states. [2018-11-23 10:29:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:07,474 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-23 10:29:07,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:29:07,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-11-23 10:29:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:29:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 105 transitions. [2018-11-23 10:29:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:29:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 105 transitions. [2018-11-23 10:29:07,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 105 transitions. [2018-11-23 10:29:07,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:07,764 INFO L225 Difference]: With dead ends: 82 [2018-11-23 10:29:07,764 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 10:29:07,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-23 10:29:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 10:29:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 45. [2018-11-23 10:29:07,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:07,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 45 states. [2018-11-23 10:29:07,850 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 45 states. [2018-11-23 10:29:07,850 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 45 states. [2018-11-23 10:29:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:07,857 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2018-11-23 10:29:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2018-11-23 10:29:07,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:07,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:07,859 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 80 states. [2018-11-23 10:29:07,859 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 80 states. [2018-11-23 10:29:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:07,866 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2018-11-23 10:29:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2018-11-23 10:29:07,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:07,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:07,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:07,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 10:29:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 10:29:07,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 24 [2018-11-23 10:29:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:07,871 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 10:29:07,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:29:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-11-23 10:29:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:29:07,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:07,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:07,873 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:07,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:07,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1490395328, now seen corresponding path program 1 times [2018-11-23 10:29:07,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:07,874 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:07,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:07,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:08,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 10:29:08,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 10:29:08,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 10:29:08,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-23 10:29:08,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:08,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-23 10:29:08,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-11-23 10:29:08,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 10:29:08,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:08,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:08,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:08,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 83 [2018-11-23 10:29:08,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-11-23 10:29:08,524 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:08,524 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_30| |main_~#a~0.base|)) (.cse1 (bvmul (_ bv16 32) main_~i~0))) (and (= (store |v_#memory_int_30| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967288 32)) main_~value~0)) |#memory_int|) (= (_ bv0 32) (bvadd (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967284 32))) (_ bv4294967286 32))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967280 32))) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 10:29:08,525 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|)) (.cse1 (bvmul (_ bv16 32) main_~i~0))) (and (= (bvadd (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv0 32) (bvadd (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967280 32))) (_ bv4294967286 32))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 10:29:08,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-23 10:29:08,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:08,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:08,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:08,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2018-11-23 10:29:08,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2018-11-23 10:29:08,688 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:08,688 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_31| |main_~#a~0.base|))) (and (= |#memory_int| (store |v_#memory_int_31| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| (_ bv12 32)) main_~value~0))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv0 32) (bvadd (select .cse0 |main_~#a~0.offset|) (_ bv4294967286 32))) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:08,689 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (_ bv0 32) (bvadd (select .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select .cse0 |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:08,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 10:29:08,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 10:29:08,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:08,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:7 [2018-11-23 10:29:09,000 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:09,001 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (_ bv0 32)))) (and (= .cse0 |main_#t~mem8|) (= (_ bv10 32) .cse0) (= (_ bv10 32) (select .cse1 (_ bv4 32))) (= main_~DEFAULTVAL~0 (_ bv0 32))))) [2018-11-23 10:29:09,001 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:09,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {941#true} is VALID [2018-11-23 10:29:09,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {941#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {941#true} is VALID [2018-11-23 10:29:09,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2018-11-23 10:29:09,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #86#return; {941#true} is VALID [2018-11-23 10:29:09,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret9 := main(); {941#true} is VALID [2018-11-23 10:29:09,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {941#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {941#true} is VALID [2018-11-23 10:29:09,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {941#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; {964#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:09,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {964#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {968#(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-23 10:29:09,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {968#(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, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {968#(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-23 10:29:09,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {968#(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(4bv32, ~i~0), 4bv32))), 4bv32); {975#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~FIXEDVAL~0) (= (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-23 10:29:09,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {975#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~FIXEDVAL~0) (= (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; {975#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~FIXEDVAL~0) (= (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-23 10:29:09,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {975#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32))) main_~FIXEDVAL~0) (= (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(4bv32, ~i~0), 3bv32))), 4bv32); {982#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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-23 10:29:09,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {982#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {982#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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-23 10:29:09,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {982#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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(4bv32, ~i~0), 2bv32))), 4bv32); {982#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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-23 10:29:09,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {982#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {982#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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-23 10:29:09,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {982#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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(4bv32, ~i~0), 1bv32))), 4bv32); {995#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |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-23 10:29:09,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {995#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |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; {995#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |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-23 10:29:09,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {995#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |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, 4bv32)); {995#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |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-23 10:29:09,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {995#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |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; {1005#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |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-23 10:29:09,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {1005#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1009#(and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:09,090 INFO L256 TraceCheckUtils]: 20: Hoare triple {1009#(and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1013#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:09,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {1013#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1017#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:09,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {1017#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {942#false} is VALID [2018-11-23 10:29:09,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {942#false} assume !false; {942#false} is VALID [2018-11-23 10:29:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:09,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:09,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-23 10:29:09,520 INFO L478 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-23 10:29:09,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:09,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:29:09,541 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-23 10:29:09,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:10 [2018-11-23 10:29:09,547 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:09,547 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) main_~FIXEDVAL~0) |main_~#a~0.offset|) main_~DEFAULTVAL~0)) [2018-11-23 10:29:09,547 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))) [2018-11-23 10:29:09,623 INFO L273 TraceCheckUtils]: 23: Hoare triple {942#false} assume !false; {942#false} is VALID [2018-11-23 10:29:09,623 INFO L273 TraceCheckUtils]: 22: Hoare triple {1027#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {942#false} is VALID [2018-11-23 10:29:09,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {1031#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1027#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:09,625 INFO L256 TraceCheckUtils]: 20: Hoare triple {1035#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1031#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:09,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {1039#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1035#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 10:29:09,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0bv32; {1039#(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-23 10:29:09,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {1043#(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; {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {1043#(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(4bv32, ~i~0), 1bv32))), 4bv32); {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {1043#(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(4bv32, ~i~0), 2bv32))), 4bv32); {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 3bv32))), 4bv32); {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {1043#(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; {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {1071#(and (= (_ bv16 32) (bvmul (_ bv16 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(4bv32, ~i~0), 4bv32))), 4bv32); {1043#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 10:29:09,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {1071#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1071#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:09,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {1078#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {1071#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:09,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {941#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; {1078#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-23 10:29:09,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {941#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {941#true} is VALID [2018-11-23 10:29:09,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret9 := main(); {941#true} is VALID [2018-11-23 10:29:09,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #86#return; {941#true} is VALID [2018-11-23 10:29:09,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2018-11-23 10:29:09,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {941#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {941#true} is VALID [2018-11-23 10:29:09,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {941#true} is VALID [2018-11-23 10:29:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:09,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:09,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-11-23 10:29:09,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 10:29:09,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:09,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 10:29:09,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:09,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 10:29:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 10:29:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-23 10:29:09,808 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 18 states. [2018-11-23 10:29:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:14,534 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2018-11-23 10:29:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 10:29:14,534 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 10:29:14,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 10:29:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 103 transitions. [2018-11-23 10:29:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 10:29:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 103 transitions. [2018-11-23 10:29:14,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 103 transitions. [2018-11-23 10:29:16,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 102 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:16,936 INFO L225 Difference]: With dead ends: 97 [2018-11-23 10:29:16,936 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 10:29:16,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2018-11-23 10:29:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 10:29:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2018-11-23 10:29:17,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:17,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 66 states. [2018-11-23 10:29:17,089 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 66 states. [2018-11-23 10:29:17,089 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 66 states. [2018-11-23 10:29:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:17,095 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 10:29:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 10:29:17,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:17,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:17,097 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 95 states. [2018-11-23 10:29:17,097 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 95 states. [2018-11-23 10:29:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:17,102 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 10:29:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 10:29:17,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:17,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:17,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:17,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 10:29:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-11-23 10:29:17,108 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 24 [2018-11-23 10:29:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:17,109 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-11-23 10:29:17,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 10:29:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-11-23 10:29:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:29:17,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:17,110 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:17,111 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:17,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2004587151, now seen corresponding path program 1 times [2018-11-23 10:29:17,111 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:17,112 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:17,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:17,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:17,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 10:29:17,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 10:29:17,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 10:29:17,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-11-23 10:29:17,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:17,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-23 10:29:17,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:26 [2018-11-23 10:29:17,618 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:17,618 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_37| |main_~#a~0.base|)) (.cse1 (bvmul (_ bv16 32) main_~i~0))) (and (= |#memory_int| (store |v_#memory_int_37| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967288 32)) main_~value~0))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4294967284 32))) (_ bv4294967286 32))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 10:29:17,619 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:29:17,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 10:29:17,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:17,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-11-23 10:29:17,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2018-11-23 10:29:17,696 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:17,697 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_38| |main_~#a~0.base|))) (and (= (bvadd (select .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= |#memory_int| (store |v_#memory_int_38| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| (_ bv12 32)) main_~value~0))) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:17,697 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:17,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 10:29:17,911 INFO L478 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-23 10:29:17,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:17,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 10:29:17,925 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:17,925 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv4 32)))) (and (= |main_#t~mem8| .cse0) (= (_ bv10 32) .cse0) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:17,925 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:17,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2018-11-23 10:29:17,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1521#true} is VALID [2018-11-23 10:29:17,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2018-11-23 10:29:17,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #86#return; {1521#true} is VALID [2018-11-23 10:29:17,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret9 := main(); {1521#true} is VALID [2018-11-23 10:29:17,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {1521#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1521#true} is VALID [2018-11-23 10:29:17,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {1521#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; {1544#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:17,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {1544#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {1548#(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-23 10:29:17,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {1548#(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, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1548#(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-23 10:29:17,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {1548#(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(4bv32, ~i~0), 4bv32))), 4bv32); {1548#(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-23 10:29:17,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {1548#(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; {1548#(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-23 10:29:17,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {1548#(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(4bv32, ~i~0), 3bv32))), 4bv32); {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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-23 10:29:17,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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-23 10:29:17,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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(4bv32, ~i~0), 2bv32))), 4bv32); {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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-23 10:29:18,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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-23 10:29:18,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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(4bv32, ~i~0), 1bv32))), 4bv32); {1574#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:18,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {1574#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 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; {1574#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:18,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {1574#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {1574#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:18,003 INFO L273 TraceCheckUtils]: 18: Hoare triple {1574#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:18,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:18,005 INFO L256 TraceCheckUtils]: 20: Hoare triple {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1591#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:18,006 INFO L273 TraceCheckUtils]: 21: Hoare triple {1591#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {1591#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:18,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {1591#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume !(0bv32 == ~cond); {1591#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:18,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {1591#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1591#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:18,008 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1591#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #90#return; {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:18,009 INFO L273 TraceCheckUtils]: 25: Hoare triple {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem8; {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:18,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {1584#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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-23 10:29:18,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {1561#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1613#(and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:18,014 INFO L256 TraceCheckUtils]: 28: Hoare triple {1613#(and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1617#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:18,015 INFO L273 TraceCheckUtils]: 29: Hoare triple {1617#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1621#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:18,015 INFO L273 TraceCheckUtils]: 30: Hoare triple {1621#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1522#false} is VALID [2018-11-23 10:29:18,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2018-11-23 10:29:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:18,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:18,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 10:29:18,417 INFO L478 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-23 10:29:18,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:18,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:29:18,438 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-23 10:29:18,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-11-23 10:29:18,444 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:18,444 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967284 32)) main_~FIXEDVAL~0) (bvadd |main_~#a~0.offset| (_ bv4 32))) main_~DEFAULTVAL~0)) [2018-11-23 10:29:18,444 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))) [2018-11-23 10:29:18,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2018-11-23 10:29:18,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {1631#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1522#false} is VALID [2018-11-23 10:29:18,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {1635#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1631#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:18,597 INFO L256 TraceCheckUtils]: 28: Hoare triple {1639#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1635#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:18,598 INFO L273 TraceCheckUtils]: 27: Hoare triple {1643#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1639#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 10:29:18,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {1647#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1643#(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-23 10:29:18,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {1647#(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~mem8; {1647#(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-23 10:29:18,808 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1521#true} {1647#(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))} #90#return; {1647#(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-23 10:29:18,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {1521#true} assume true; {1521#true} is VALID [2018-11-23 10:29:18,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {1521#true} assume !(0bv32 == ~cond); {1521#true} is VALID [2018-11-23 10:29:18,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {1521#true} ~cond := #in~cond; {1521#true} is VALID [2018-11-23 10:29:18,808 INFO L256 TraceCheckUtils]: 20: Hoare triple {1647#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1521#true} is VALID [2018-11-23 10:29:18,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {1647#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1647#(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-23 10:29:18,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} ~i~0 := 0bv32; {1647#(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-23 10:29:18,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {1672#(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, 4bv32)); {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:18,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {1672#(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; {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:18,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 1bv32))), 4bv32); {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:18,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:18,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 2bv32))), 4bv32); {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:18,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:18,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {1694#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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(4bv32, ~i~0), 3bv32))), 4bv32); {1672#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:29:18,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {1694#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1694#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:18,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {1694#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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(4bv32, ~i~0), 4bv32))), 4bv32); {1694#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:18,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {1694#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1694#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:18,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {1707#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {1694#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:29:18,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {1521#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; {1707#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-23 10:29:18,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {1521#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1521#true} is VALID [2018-11-23 10:29:18,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret9 := main(); {1521#true} is VALID [2018-11-23 10:29:18,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #86#return; {1521#true} is VALID [2018-11-23 10:29:18,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2018-11-23 10:29:18,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1521#true} is VALID [2018-11-23 10:29:18,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2018-11-23 10:29:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:18,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:18,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-23 10:29:18,829 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-23 10:29:18,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:18,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 10:29:19,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:19,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 10:29:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 10:29:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-11-23 10:29:19,223 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 19 states. [2018-11-23 10:29:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:27,596 INFO L93 Difference]: Finished difference Result 207 states and 268 transitions. [2018-11-23 10:29:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 10:29:27,596 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-23 10:29:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:29:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2018-11-23 10:29:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:29:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2018-11-23 10:29:27,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 137 transitions. [2018-11-23 10:29:32,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 135 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:32,089 INFO L225 Difference]: With dead ends: 207 [2018-11-23 10:29:32,090 INFO L226 Difference]: Without dead ends: 205 [2018-11-23 10:29:32,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 10:29:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-23 10:29:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 43. [2018-11-23 10:29:32,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:32,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand 43 states. [2018-11-23 10:29:32,261 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 43 states. [2018-11-23 10:29:32,261 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 43 states. [2018-11-23 10:29:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:32,270 INFO L93 Difference]: Finished difference Result 205 states and 265 transitions. [2018-11-23 10:29:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2018-11-23 10:29:32,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:32,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:32,272 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 205 states. [2018-11-23 10:29:32,272 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 205 states. [2018-11-23 10:29:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:32,281 INFO L93 Difference]: Finished difference Result 205 states and 265 transitions. [2018-11-23 10:29:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2018-11-23 10:29:32,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:32,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:32,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:32,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 10:29:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 10:29:32,285 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 32 [2018-11-23 10:29:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:32,285 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 10:29:32,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 10:29:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 10:29:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 10:29:32,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:32,287 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-23 10:29:32,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:32,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash -899994716, now seen corresponding path program 2 times [2018-11-23 10:29:32,288 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:32,317 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:29:32,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:29:32,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:29:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:32,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:32,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 10:29:32,554 INFO L478 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-23 10:29:32,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-23 10:29:32,593 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:32,593 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= |#memory_int| (store |v_#memory_int_43| |main_~#a~0.base| (store (select |v_#memory_int_43| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)) main_~value~0))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:29:32,594 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:29:32,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 10:29:32,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:32,678 INFO L478 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-23 10:29:32,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-11-23 10:29:32,723 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:32,723 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_44|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_44| |main_~#a~0.base|))) (and (not (= main_~DEFAULTVAL~0 (select .cse0 (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (store |v_#memory_int_44| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| (_ bv12 32)) main_~value~0)) |#memory_int|) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:32,723 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))) [2018-11-23 10:29:32,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 10:29:32,990 INFO L478 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-23 10:29:32,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-23 10:29:33,003 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:33,003 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv8 32)))) (and (= |main_#t~mem8| .cse0) (not (= main_~DEFAULTVAL~0 .cse0)) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:29:33,003 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:29:33,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {2481#true} call ULTIMATE.init(); {2481#true} is VALID [2018-11-23 10:29:33,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {2481#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2481#true} is VALID [2018-11-23 10:29:33,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {2481#true} assume true; {2481#true} is VALID [2018-11-23 10:29:33,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2481#true} {2481#true} #86#return; {2481#true} is VALID [2018-11-23 10:29:33,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {2481#true} call #t~ret9 := main(); {2481#true} is VALID [2018-11-23 10:29:33,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {2481#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2481#true} is VALID [2018-11-23 10:29:33,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {2481#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; {2504#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:33,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {2504#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {2508#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {2508#(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, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2508#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {2508#(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(4bv32, ~i~0), 4bv32))), 4bv32); {2508#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {2508#(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; {2508#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {2508#(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(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 3bv32))), 4bv32); {2508#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {2508#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {2508#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {2508#(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(4bv32, ~i~0), 2bv32))), 4bv32); {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 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(4bv32, ~i~0), 1bv32))), 4bv32); {2534#(and (= |main_~#a~0.offset| (_ 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-23 10:29:33,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {2534#(and (= |main_~#a~0.offset| (_ 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~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2534#(and (= |main_~#a~0.offset| (_ 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-23 10:29:33,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {2534#(and (= |main_~#a~0.offset| (_ 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 !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {2534#(and (= |main_~#a~0.offset| (_ 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-23 10:29:33,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {2534#(and (= |main_~#a~0.offset| (_ 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)))} ~i~0 := 0bv32; {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:33,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:33,087 INFO L256 TraceCheckUtils]: 20: Hoare triple {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-23 10:29:33,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} ~cond := #in~cond; {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-23 10:29:33,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-23 10:29:33,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} assume true; {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-23 10:29:33,090 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #90#return; {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:33,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem8; {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:33,091 INFO L273 TraceCheckUtils]: 26: Hoare triple {2544#(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| (_ bv8 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,094 INFO L256 TraceCheckUtils]: 28: Hoare triple {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-23 10:29:33,095 INFO L273 TraceCheckUtils]: 29: Hoare triple {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} ~cond := #in~cond; {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-23 10:29:33,095 INFO L273 TraceCheckUtils]: 30: Hoare triple {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-23 10:29:33,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} assume true; {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-23 10:29:33,097 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2551#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv0 32))))} {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #90#return; {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,098 INFO L273 TraceCheckUtils]: 33: Hoare triple {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem8; {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:33,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {2527#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2594#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967272 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:33,101 INFO L273 TraceCheckUtils]: 35: Hoare triple {2594#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967272 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2598#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:29:33,102 INFO L256 TraceCheckUtils]: 36: Hoare triple {2598#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2602#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:33,103 INFO L273 TraceCheckUtils]: 37: Hoare triple {2602#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2606#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:33,104 INFO L273 TraceCheckUtils]: 38: Hoare triple {2606#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2482#false} is VALID [2018-11-23 10:29:33,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {2482#false} assume !false; {2482#false} is VALID [2018-11-23 10:29:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:29:33,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:33,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 10:29:33,734 INFO L478 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-23 10:29:33,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,753 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-23 10:29:33,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-23 10:29:33,759 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:33,759 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, main_~value~0]. (or (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= main_~value~0 main_~DEFAULTVAL~0)) [2018-11-23 10:29:33,760 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) [2018-11-23 10:29:33,818 INFO L273 TraceCheckUtils]: 39: Hoare triple {2482#false} assume !false; {2482#false} is VALID [2018-11-23 10:29:33,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {2616#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2482#false} is VALID [2018-11-23 10:29:33,819 INFO L273 TraceCheckUtils]: 37: Hoare triple {2620#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2616#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:29:33,821 INFO L256 TraceCheckUtils]: 36: Hoare triple {2624#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2620#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:29:33,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {2628#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2624#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 10:29:34,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {2632#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2628#(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-23 10:29:34,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {2632#(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~mem8; {2632#(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-23 10:29:34,020 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2481#true} {2632#(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))} #90#return; {2632#(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-23 10:29:34,020 INFO L273 TraceCheckUtils]: 31: Hoare triple {2481#true} assume true; {2481#true} is VALID [2018-11-23 10:29:34,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {2481#true} assume !(0bv32 == ~cond); {2481#true} is VALID [2018-11-23 10:29:34,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {2481#true} ~cond := #in~cond; {2481#true} is VALID [2018-11-23 10:29:34,021 INFO L256 TraceCheckUtils]: 28: Hoare triple {2632#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2481#true} is VALID [2018-11-23 10:29:34,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {2632#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2632#(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-23 10:29:34,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {2657#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2632#(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-23 10:29:34,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {2657#(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~mem8; {2657#(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-23 10:29:34,378 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2481#true} {2657#(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)))))} #90#return; {2657#(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-23 10:29:34,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {2481#true} assume true; {2481#true} is VALID [2018-11-23 10:29:34,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {2481#true} assume !(0bv32 == ~cond); {2481#true} is VALID [2018-11-23 10:29:34,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {2481#true} ~cond := #in~cond; {2481#true} is VALID [2018-11-23 10:29:34,379 INFO L256 TraceCheckUtils]: 20: Hoare triple {2657#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2481#true} is VALID [2018-11-23 10:29:34,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {2657#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2657#(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-23 10:29:34,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {2682#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} ~i~0 := 0bv32; {2657#(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-23 10:29:34,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {2682#(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, 4bv32)); {2682#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:34,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {2682#(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; {2682#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:34,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {2682#(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(4bv32, ~i~0), 1bv32))), 4bv32); {2682#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:34,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {2682#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {2682#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:34,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 2bv32))), 4bv32); {2682#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:29:34,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:34,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 3bv32))), 4bv32); {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:34,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:34,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 4bv32))), 4bv32); {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:34,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:34,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {2481#true} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {2698#(= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:34,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {2481#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; {2481#true} is VALID [2018-11-23 10:29:34,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {2481#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2481#true} is VALID [2018-11-23 10:29:34,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {2481#true} call #t~ret9 := main(); {2481#true} is VALID [2018-11-23 10:29:34,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2481#true} {2481#true} #86#return; {2481#true} is VALID [2018-11-23 10:29:34,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {2481#true} assume true; {2481#true} is VALID [2018-11-23 10:29:34,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {2481#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2481#true} is VALID [2018-11-23 10:29:34,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {2481#true} call ULTIMATE.init(); {2481#true} is VALID [2018-11-23 10:29:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:29:34,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:34,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-23 10:29:34,401 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-11-23 10:29:34,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:34,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 10:29:35,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:35,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 10:29:35,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 10:29:35,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-11-23 10:29:35,091 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 20 states. [2018-11-23 10:30:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:30:44,278 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2018-11-23 10:30:44,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 10:30:44,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-11-23 10:30:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:30:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:30:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 220 transitions. [2018-11-23 10:30:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:30:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 220 transitions. [2018-11-23 10:30:44,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 220 transitions. [2018-11-23 10:30:45,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:30:45,083 INFO L225 Difference]: With dead ends: 186 [2018-11-23 10:30:45,084 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 10:30:45,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=235, Invalid=1097, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 10:30:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 10:30:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 75. [2018-11-23 10:30:45,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:30:45,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 75 states. [2018-11-23 10:30:45,396 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 75 states. [2018-11-23 10:30:45,397 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 75 states. [2018-11-23 10:30:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:30:45,405 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2018-11-23 10:30:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 238 transitions. [2018-11-23 10:30:45,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:30:45,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:30:45,406 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 184 states. [2018-11-23 10:30:45,406 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 184 states. [2018-11-23 10:30:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:30:45,420 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2018-11-23 10:30:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 238 transitions. [2018-11-23 10:30:45,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:30:45,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:30:45,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:30:45,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:30:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 10:30:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2018-11-23 10:30:45,424 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 40 [2018-11-23 10:30:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:30:45,425 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2018-11-23 10:30:45,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 10:30:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2018-11-23 10:30:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 10:30:45,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:30:45,426 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-23 10:30:45,426 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:30:45,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:30:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1023233318, now seen corresponding path program 1 times [2018-11-23 10:30:45,429 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:30:45,429 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:30:45,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:30:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:30:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:30:45,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:30:45,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 10:30:45,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 10:30:45,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:45,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:45,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:45,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 10:30:45,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 10:30:45,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:45,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 10:30:45,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:45,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:45,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:45,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-23 10:30:45,831 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:30:45,832 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, main_~value~0]. (let ((.cse0 (select |v_#memory_int_50| |main_~#a~0.base|))) (and (= |main_~#a~0.offset| (_ bv0 32)) (= (store |v_#memory_int_50| |main_~#a~0.base| (store .cse0 (bvadd |main_~#a~0.offset| (_ bv12 32)) main_~value~0)) |#memory_int|) (= (select .cse0 (bvadd |main_~#a~0.offset| (_ bv8 32))) (_ bv10 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:30:45,832 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:30:46,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 10:30:46,139 INFO L478 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-23 10:30:46,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:46,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:46,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:46,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 10:30:46,154 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:30:46,155 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv8 32)))) (and (= (_ bv10 32) .cse0) (= |main_#t~mem8| .cse0) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:30:46,155 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:30:46,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {3457#true} call ULTIMATE.init(); {3457#true} is VALID [2018-11-23 10:30:46,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {3457#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3457#true} is VALID [2018-11-23 10:30:46,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {3457#true} assume true; {3457#true} is VALID [2018-11-23 10:30:46,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3457#true} {3457#true} #86#return; {3457#true} is VALID [2018-11-23 10:30:46,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {3457#true} call #t~ret9 := main(); {3457#true} is VALID [2018-11-23 10:30:46,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {3457#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3457#true} is VALID [2018-11-23 10:30:46,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {3457#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; {3480#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {3480#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {3484#(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-23 10:30:46,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {3484#(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, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3484#(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-23 10:30:46,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {3484#(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(4bv32, ~i~0), 4bv32))), 4bv32); {3484#(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-23 10:30:46,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {3484#(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; {3484#(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-23 10:30:46,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {3484#(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(4bv32, ~i~0), 3bv32))), 4bv32); {3484#(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-23 10:30:46,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {3484#(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~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {3484#(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-23 10:30:46,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {3484#(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(4bv32, ~i~0), 2bv32))), 4bv32); {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 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(4bv32, ~i~0), 1bv32))), 4bv32); {3510#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {3510#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 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; {3510#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {3510#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {3510#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {3510#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,239 INFO L256 TraceCheckUtils]: 20: Hoare triple {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume !(0bv32 == ~cond); {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,241 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #90#return; {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem8; {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {3520#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,245 INFO L273 TraceCheckUtils]: 27: Hoare triple {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,248 INFO L256 TraceCheckUtils]: 28: Hoare triple {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume !(0bv32 == ~cond); {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,251 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3527#(exists ((|v_main_~#a~0.base_BEFORE_CALL_7| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (_ bv8 32)) (_ bv4294967286 32)) (_ bv0 32)))} {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #90#return; {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,252 INFO L273 TraceCheckUtils]: 33: Hoare triple {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem8; {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:30:46,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {3503#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3570#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967272 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,255 INFO L273 TraceCheckUtils]: 35: Hoare triple {3570#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967272 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3574#(and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:30:46,256 INFO L256 TraceCheckUtils]: 36: Hoare triple {3574#(and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3578#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:30:46,258 INFO L273 TraceCheckUtils]: 37: Hoare triple {3578#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3582#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:30:46,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {3582#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3458#false} is VALID [2018-11-23 10:30:46,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2018-11-23 10:30:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:30:46,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:30:46,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 10:30:46,703 INFO L478 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-23 10:30:46,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:46,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:30:46,725 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-23 10:30:46,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-11-23 10:30:46,731 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:30:46,732 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967288 32)) main_~FIXEDVAL~0) (bvadd |main_~#a~0.offset| (_ bv8 32))) main_~DEFAULTVAL~0)) [2018-11-23 10:30:46,732 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))) [2018-11-23 10:30:46,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2018-11-23 10:30:46,821 INFO L273 TraceCheckUtils]: 38: Hoare triple {3592#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3458#false} is VALID [2018-11-23 10:30:46,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {3596#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3592#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:30:46,823 INFO L256 TraceCheckUtils]: 36: Hoare triple {3600#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3596#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:30:46,824 INFO L273 TraceCheckUtils]: 35: Hoare triple {3604#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3600#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 10:30:47,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {3608#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3604#(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-23 10:30:47,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {3608#(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~mem8; {3608#(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-23 10:30:47,027 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3457#true} {3608#(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))} #90#return; {3608#(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-23 10:30:47,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {3457#true} assume true; {3457#true} is VALID [2018-11-23 10:30:47,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {3457#true} assume !(0bv32 == ~cond); {3457#true} is VALID [2018-11-23 10:30:47,028 INFO L273 TraceCheckUtils]: 29: Hoare triple {3457#true} ~cond := #in~cond; {3457#true} is VALID [2018-11-23 10:30:47,028 INFO L256 TraceCheckUtils]: 28: Hoare triple {3608#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3457#true} is VALID [2018-11-23 10:30:47,028 INFO L273 TraceCheckUtils]: 27: Hoare triple {3608#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3608#(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-23 10:30:47,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {3633#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3608#(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-23 10:30:47,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {3633#(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~mem8; {3633#(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-23 10:30:47,343 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3457#true} {3633#(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)))))} #90#return; {3633#(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-23 10:30:47,343 INFO L273 TraceCheckUtils]: 23: Hoare triple {3457#true} assume true; {3457#true} is VALID [2018-11-23 10:30:47,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {3457#true} assume !(0bv32 == ~cond); {3457#true} is VALID [2018-11-23 10:30:47,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {3457#true} ~cond := #in~cond; {3457#true} is VALID [2018-11-23 10:30:47,344 INFO L256 TraceCheckUtils]: 20: Hoare triple {3633#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {3457#true} is VALID [2018-11-23 10:30:47,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {3633#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3633#(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-23 10:30:47,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {3658#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} ~i~0 := 0bv32; {3633#(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-23 10:30:47,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {3658#(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, 4bv32)); {3658#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:47,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {3658#(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; {3658#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:47,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {3658#(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(4bv32, ~i~0), 1bv32))), 4bv32); {3658#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:47,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {3658#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {3658#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:47,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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(4bv32, ~i~0), 2bv32))), 4bv32); {3658#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))))} is VALID [2018-11-23 10:30:47,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:30:47,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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(4bv32, ~i~0), 3bv32))), 4bv32); {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:30:47,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:30:47,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 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(4bv32, ~i~0), 4bv32))), 4bv32); {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:30:47,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:30:47,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {3693#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {3674#(and (= (bvadd (bvmul (_ bv16 32) main_~i~0) (_ bv4294967280 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:30:47,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {3457#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; {3693#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-23 10:30:47,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {3457#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3457#true} is VALID [2018-11-23 10:30:47,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {3457#true} call #t~ret9 := main(); {3457#true} is VALID [2018-11-23 10:30:47,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3457#true} {3457#true} #86#return; {3457#true} is VALID [2018-11-23 10:30:47,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {3457#true} assume true; {3457#true} is VALID [2018-11-23 10:30:47,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {3457#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3457#true} is VALID [2018-11-23 10:30:47,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {3457#true} call ULTIMATE.init(); {3457#true} is VALID [2018-11-23 10:30:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:30:47,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:30:47,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-23 10:30:47,431 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-11-23 10:30:47,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:30:47,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 10:30:48,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:30:48,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 10:30:48,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 10:30:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-11-23 10:30:48,146 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand 21 states. [2018-11-23 10:31:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:08,622 INFO L93 Difference]: Finished difference Result 171 states and 209 transitions. [2018-11-23 10:31:08,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 10:31:08,622 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-11-23 10:31:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:31:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:31:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 159 transitions. [2018-11-23 10:31:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:31:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 159 transitions. [2018-11-23 10:31:08,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 159 transitions. [2018-11-23 10:31:15,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 156 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 10:31:15,209 INFO L225 Difference]: With dead ends: 171 [2018-11-23 10:31:15,209 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 10:31:15,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=328, Invalid=1564, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 10:31:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 10:31:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 110. [2018-11-23 10:31:16,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:31:16,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 110 states. [2018-11-23 10:31:16,092 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 110 states. [2018-11-23 10:31:16,092 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 110 states. [2018-11-23 10:31:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:16,100 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2018-11-23 10:31:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2018-11-23 10:31:16,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:31:16,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:31:16,101 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 169 states. [2018-11-23 10:31:16,101 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 169 states. [2018-11-23 10:31:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:31:16,107 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2018-11-23 10:31:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2018-11-23 10:31:16,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:31:16,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:31:16,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:31:16,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:31:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 10:31:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2018-11-23 10:31:16,113 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 139 transitions. Word has length 40 [2018-11-23 10:31:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:31:16,113 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 139 transitions. [2018-11-23 10:31:16,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 10:31:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 139 transitions. [2018-11-23 10:31:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 10:31:16,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:31:16,114 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:31:16,115 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:31:16,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:31:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash 708183767, now seen corresponding path program 3 times [2018-11-23 10:31:16,115 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:31:16,115 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:31:16,144 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:31:16,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 10:31:16,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:31:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:31:16,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:31:16,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 10:31:16,551 INFO L478 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-23 10:31:16,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:16,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:16,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:16,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-23 10:31:16,588 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:31:16,588 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_55|, main_~value~0]. (and (not (= main_~value~0 main_~DEFAULTVAL~0)) (= |main_~#a~0.offset| (_ bv0 32)) (= (store |v_#memory_int_55| |main_~#a~0.base| (store (select |v_#memory_int_55| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)) main_~value~0)) |#memory_int|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:31:16,588 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:31:16,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 10:31:17,002 INFO L478 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-23 10:31:17,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:17,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:17,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:17,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-23 10:31:17,017 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:31:17,017 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv12 32)))) (and (= .cse0 |main_#t~mem8|) (not (= main_~DEFAULTVAL~0 .cse0)) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:31:17,018 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:31:17,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {4455#true} call ULTIMATE.init(); {4455#true} is VALID [2018-11-23 10:31:17,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {4455#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4455#true} is VALID [2018-11-23 10:31:17,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {4455#true} assume true; {4455#true} is VALID [2018-11-23 10:31:17,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4455#true} {4455#true} #86#return; {4455#true} is VALID [2018-11-23 10:31:17,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {4455#true} call #t~ret9 := main(); {4455#true} is VALID [2018-11-23 10:31:17,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {4455#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4455#true} is VALID [2018-11-23 10:31:17,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {4455#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; {4478#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {4478#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {4482#(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, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {4482#(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(4bv32, ~i~0), 4bv32))), 4bv32); {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {4482#(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; {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {4482#(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(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 3bv32))), 4bv32); {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {4482#(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(4bv32, ~i~0), 2bv32))), 4bv32); {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {4482#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {4482#(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(4bv32, ~i~0), 1bv32))), 4bv32); {4507#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {4507#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4507#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {4507#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {4507#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {4507#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,085 INFO L256 TraceCheckUtils]: 20: Hoare triple {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} ~cond := #in~cond; {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} assume true; {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,088 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #90#return; {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem8; {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {4517#(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| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,094 INFO L256 TraceCheckUtils]: 28: Hoare triple {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,094 INFO L273 TraceCheckUtils]: 29: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} ~cond := #in~cond; {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,095 INFO L273 TraceCheckUtils]: 30: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} assume true; {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,098 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #90#return; {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem8; {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:31:17,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {4543#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,104 INFO L256 TraceCheckUtils]: 36: Hoare triple {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,105 INFO L273 TraceCheckUtils]: 37: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} ~cond := #in~cond; {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,106 INFO L273 TraceCheckUtils]: 39: Hoare triple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} assume true; {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} is VALID [2018-11-23 10:31:17,107 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4524#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (_ bv12 32)) (_ bv0 32))))} {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #90#return; {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,107 INFO L273 TraceCheckUtils]: 41: Hoare triple {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem8; {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,108 INFO L273 TraceCheckUtils]: 42: Hoare triple {4568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4593#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,109 INFO L273 TraceCheckUtils]: 43: Hoare triple {4593#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4597#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:31:17,110 INFO L256 TraceCheckUtils]: 44: Hoare triple {4597#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem8|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4601#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:31:17,111 INFO L273 TraceCheckUtils]: 45: Hoare triple {4601#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4605#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:31:17,111 INFO L273 TraceCheckUtils]: 46: Hoare triple {4605#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4456#false} is VALID [2018-11-23 10:31:17,112 INFO L273 TraceCheckUtils]: 47: Hoare triple {4456#false} assume !false; {4456#false} is VALID [2018-11-23 10:31:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 10:31:17,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:31:17,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 10:31:17,589 INFO L478 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-23 10:31:17,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:17,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:17,608 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-23 10:31:17,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:5 [2018-11-23 10:31:17,614 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:31:17,614 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|, main_~value~0]. (or (= main_~value~0 main_~DEFAULTVAL~0) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv12 32)))))) [2018-11-23 10:31:17,614 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) [2018-11-23 10:31:17,669 INFO L273 TraceCheckUtils]: 47: Hoare triple {4456#false} assume !false; {4456#false} is VALID [2018-11-23 10:31:17,670 INFO L273 TraceCheckUtils]: 46: Hoare triple {4615#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {4456#false} is VALID [2018-11-23 10:31:17,670 INFO L273 TraceCheckUtils]: 45: Hoare triple {4619#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4615#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:31:17,671 INFO L256 TraceCheckUtils]: 44: Hoare triple {4623#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4619#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:31:17,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {4627#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4623#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 10:31:17,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {4631#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4627#(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-23 10:31:17,861 INFO L273 TraceCheckUtils]: 41: Hoare triple {4631#(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~mem8; {4631#(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-23 10:31:17,862 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4455#true} {4631#(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))} #90#return; {4631#(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-23 10:31:17,862 INFO L273 TraceCheckUtils]: 39: Hoare triple {4455#true} assume true; {4455#true} is VALID [2018-11-23 10:31:17,862 INFO L273 TraceCheckUtils]: 38: Hoare triple {4455#true} assume !(0bv32 == ~cond); {4455#true} is VALID [2018-11-23 10:31:17,862 INFO L273 TraceCheckUtils]: 37: Hoare triple {4455#true} ~cond := #in~cond; {4455#true} is VALID [2018-11-23 10:31:17,862 INFO L256 TraceCheckUtils]: 36: Hoare triple {4631#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4455#true} is VALID [2018-11-23 10:31:17,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {4631#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4631#(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-23 10:31:18,248 INFO L273 TraceCheckUtils]: 34: Hoare triple {4656#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4631#(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-23 10:31:18,248 INFO L273 TraceCheckUtils]: 33: Hoare triple {4656#(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~mem8; {4656#(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-23 10:31:18,249 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {4455#true} {4656#(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)))))} #90#return; {4656#(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-23 10:31:18,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {4455#true} assume true; {4455#true} is VALID [2018-11-23 10:31:18,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {4455#true} assume !(0bv32 == ~cond); {4455#true} is VALID [2018-11-23 10:31:18,250 INFO L273 TraceCheckUtils]: 29: Hoare triple {4455#true} ~cond := #in~cond; {4455#true} is VALID [2018-11-23 10:31:18,250 INFO L256 TraceCheckUtils]: 28: Hoare triple {4656#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4455#true} is VALID [2018-11-23 10:31:18,250 INFO L273 TraceCheckUtils]: 27: Hoare triple {4656#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4656#(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-23 10:31:18,560 INFO L273 TraceCheckUtils]: 26: Hoare triple {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4656#(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-23 10:31:18,561 INFO L273 TraceCheckUtils]: 25: Hoare triple {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} havoc #t~mem8; {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:31:18,562 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {4455#true} {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} #90#return; {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:31:18,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {4455#true} assume true; {4455#true} is VALID [2018-11-23 10:31:18,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {4455#true} assume !(0bv32 == ~cond); {4455#true} is VALID [2018-11-23 10:31:18,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {4455#true} ~cond := #in~cond; {4455#true} is VALID [2018-11-23 10:31:18,562 INFO L256 TraceCheckUtils]: 20: Hoare triple {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {4455#true} is VALID [2018-11-23 10:31:18,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:31:18,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {4706#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} ~i~0 := 0bv32; {4681#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:31:18,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {4706#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {4706#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:31:18,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {4706#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4706#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:31:18,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {4716#(= (_ bv16 32) (bvmul (_ bv16 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(4bv32, ~i~0), 1bv32))), 4bv32); {4706#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:31:18,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:31:18,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {4716#(= (_ bv16 32) (bvmul (_ bv16 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(4bv32, ~i~0), 2bv32))), 4bv32); {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:31:18,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:31:18,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(4bv32, ~i~0), 3bv32))), 4bv32); {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:31:18,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:31:18,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {4716#(= (_ bv16 32) (bvmul (_ bv16 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(4bv32, ~i~0), 4bv32))), 4bv32); {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:31:18,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:31:18,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {4455#true} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {4716#(= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0))} is VALID [2018-11-23 10:31:18,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {4455#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; {4455#true} is VALID [2018-11-23 10:31:18,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {4455#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4455#true} is VALID [2018-11-23 10:31:18,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {4455#true} call #t~ret9 := main(); {4455#true} is VALID [2018-11-23 10:31:18,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4455#true} {4455#true} #86#return; {4455#true} is VALID [2018-11-23 10:31:18,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {4455#true} assume true; {4455#true} is VALID [2018-11-23 10:31:18,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {4455#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4455#true} is VALID [2018-11-23 10:31:18,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {4455#true} call ULTIMATE.init(); {4455#true} is VALID [2018-11-23 10:31:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 10:31:18,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:31:18,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-23 10:31:18,579 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 10:31:18,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:31:18,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 10:31:19,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:31:19,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 10:31:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 10:31:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-23 10:31:19,599 INFO L87 Difference]: Start difference. First operand 110 states and 139 transitions. Second operand 22 states. [2018-11-23 10:32:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:22,646 INFO L93 Difference]: Finished difference Result 463 states and 626 transitions. [2018-11-23 10:32:22,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 10:32:22,646 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 10:32:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:32:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:32:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 328 transitions. [2018-11-23 10:32:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:32:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 328 transitions. [2018-11-23 10:32:22,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 328 transitions. [2018-11-23 10:32:24,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:32:24,967 INFO L225 Difference]: With dead ends: 463 [2018-11-23 10:32:24,967 INFO L226 Difference]: Without dead ends: 461 [2018-11-23 10:32:24,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=369, Invalid=1887, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:32:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-23 10:32:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 202. [2018-11-23 10:32:25,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:32:25,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand 202 states. [2018-11-23 10:32:25,558 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand 202 states. [2018-11-23 10:32:25,558 INFO L87 Difference]: Start difference. First operand 461 states. Second operand 202 states. [2018-11-23 10:32:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:25,580 INFO L93 Difference]: Finished difference Result 461 states and 624 transitions. [2018-11-23 10:32:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 624 transitions. [2018-11-23 10:32:25,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:32:25,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:32:25,583 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 461 states. [2018-11-23 10:32:25,583 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 461 states. [2018-11-23 10:32:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:25,606 INFO L93 Difference]: Finished difference Result 461 states and 624 transitions. [2018-11-23 10:32:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 624 transitions. [2018-11-23 10:32:25,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:32:25,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:32:25,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:32:25,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:32:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-23 10:32:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 268 transitions. [2018-11-23 10:32:25,615 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 268 transitions. Word has length 48 [2018-11-23 10:32:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:32:25,616 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 268 transitions. [2018-11-23 10:32:25,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 10:32:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 268 transitions. [2018-11-23 10:32:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 10:32:25,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:32:25,617 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:32:25,617 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:32:25,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:32:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash 635797209, now seen corresponding path program 1 times [2018-11-23 10:32:25,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:32:25,618 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:32:25,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:32:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:32:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:32:25,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:32:25,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 10:32:25,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 10:32:25,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:25,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:25,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:25,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 10:32:26,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 10:32:26,409 INFO L478 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-23 10:32:26,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:26,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:26,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:26,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 10:32:26,422 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:32:26,423 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv12 32)))) (and (= .cse0 |main_#t~mem8|) (= (_ bv10 32) .cse0) (= main_~DEFAULTVAL~0 (_ bv0 32)))) [2018-11-23 10:32:26,423 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32))) [2018-11-23 10:32:26,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {6534#true} call ULTIMATE.init(); {6534#true} is VALID [2018-11-23 10:32:26,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {6534#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {6534#true} is VALID [2018-11-23 10:32:26,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {6534#true} assume true; {6534#true} is VALID [2018-11-23 10:32:26,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6534#true} {6534#true} #86#return; {6534#true} is VALID [2018-11-23 10:32:26,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {6534#true} call #t~ret9 := main(); {6534#true} is VALID [2018-11-23 10:32:26,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {6534#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6534#true} is VALID [2018-11-23 10:32:26,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {6534#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; {6557#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {6557#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {6561#(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-23 10:32:26,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {6561#(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, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {6561#(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-23 10:32:26,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {6561#(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(4bv32, ~i~0), 4bv32))), 4bv32); {6561#(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-23 10:32:26,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {6561#(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; {6561#(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-23 10:32:26,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {6561#(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(4bv32, ~i~0), 3bv32))), 4bv32); {6561#(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-23 10:32:26,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {6561#(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~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {6561#(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-23 10:32:26,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {6561#(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(4bv32, ~i~0), 2bv32))), 4bv32); {6561#(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-23 10:32:26,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {6561#(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~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {6561#(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-23 10:32:26,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {6561#(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(4bv32, ~i~0), 1bv32))), 4bv32); {6586#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {6586#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 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; {6586#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {6586#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {6586#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {6586#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,578 INFO L256 TraceCheckUtils]: 20: Hoare triple {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} ~cond := #in~cond; {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} assume !(0bv32 == ~cond); {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} assume true; {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,580 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #90#return; {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,581 INFO L273 TraceCheckUtils]: 25: Hoare triple {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem8; {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {6596#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:26,583 INFO L273 TraceCheckUtils]: 27: Hoare triple {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:26,585 INFO L256 TraceCheckUtils]: 28: Hoare triple {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} ~cond := #in~cond; {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} assume !(0bv32 == ~cond); {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} assume true; {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,587 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #90#return; {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:26,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem8; {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:32:26,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {6622#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,589 INFO L273 TraceCheckUtils]: 35: Hoare triple {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,591 INFO L256 TraceCheckUtils]: 36: Hoare triple {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} ~cond := #in~cond; {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} assume !(0bv32 == ~cond); {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,593 INFO L273 TraceCheckUtils]: 39: Hoare triple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} assume true; {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} is VALID [2018-11-23 10:32:26,594 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {6603#(exists ((|v_main_~#a~0.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv10 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (_ bv12 32))))} {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #90#return; {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,594 INFO L273 TraceCheckUtils]: 41: Hoare triple {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem8; {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {6647#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {6672#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,597 INFO L273 TraceCheckUtils]: 43: Hoare triple {6672#(and (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6676#(and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-23 10:32:26,598 INFO L256 TraceCheckUtils]: 44: Hoare triple {6676#(and (= (_ bv10 32) |main_#t~mem8|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {6680#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:32:26,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {6680#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {6684#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:32:26,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {6684#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {6535#false} is VALID [2018-11-23 10:32:26,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {6535#false} assume !false; {6535#false} is VALID [2018-11-23 10:32:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 10:32:26,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:32:27,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 10:32:27,099 INFO L478 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-23 10:32:27,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:27,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:32:27,121 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-23 10:32:27,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-11-23 10:32:27,127 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:32:27,127 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (not (= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv16 32) main_~i~0) (_ bv4294967292 32)) main_~FIXEDVAL~0) (bvadd |main_~#a~0.offset| (_ bv12 32))) main_~DEFAULTVAL~0)) [2018-11-23 10:32:27,127 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))) [2018-11-23 10:32:27,224 INFO L273 TraceCheckUtils]: 47: Hoare triple {6535#false} assume !false; {6535#false} is VALID [2018-11-23 10:32:27,224 INFO L273 TraceCheckUtils]: 46: Hoare triple {6694#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {6535#false} is VALID [2018-11-23 10:32:27,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {6698#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {6694#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:32:27,226 INFO L256 TraceCheckUtils]: 44: Hoare triple {6702#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {6698#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:32:27,226 INFO L273 TraceCheckUtils]: 43: Hoare triple {6706#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6702#(not (= main_~DEFAULTVAL~0 |main_#t~mem8|))} is VALID [2018-11-23 10:32:27,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {6710#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {6706#(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-23 10:32:27,479 INFO L273 TraceCheckUtils]: 41: Hoare triple {6710#(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~mem8; {6710#(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-23 10:32:27,480 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {6534#true} {6710#(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))} #90#return; {6710#(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-23 10:32:27,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {6534#true} assume true; {6534#true} is VALID [2018-11-23 10:32:27,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {6534#true} assume !(0bv32 == ~cond); {6534#true} is VALID [2018-11-23 10:32:27,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {6534#true} ~cond := #in~cond; {6534#true} is VALID [2018-11-23 10:32:27,480 INFO L256 TraceCheckUtils]: 36: Hoare triple {6710#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {6534#true} is VALID [2018-11-23 10:32:27,480 INFO L273 TraceCheckUtils]: 35: Hoare triple {6710#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6710#(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-23 10:32:27,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {6735#(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~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {6710#(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-23 10:32:27,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {6735#(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~mem8; {6735#(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-23 10:32:27,776 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {6534#true} {6735#(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)))))} #90#return; {6735#(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-23 10:32:27,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {6534#true} assume true; {6534#true} is VALID [2018-11-23 10:32:27,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {6534#true} assume !(0bv32 == ~cond); {6534#true} is VALID [2018-11-23 10:32:27,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {6534#true} ~cond := #in~cond; {6534#true} is VALID [2018-11-23 10:32:27,776 INFO L256 TraceCheckUtils]: 28: Hoare triple {6735#(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~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {6534#true} is VALID [2018-11-23 10:32:27,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {6735#(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~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6735#(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-23 10:32:28,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {6735#(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-23 10:32:28,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} havoc #t~mem8; {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:32:28,111 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {6534#true} {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} #90#return; {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:32:28,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {6534#true} assume true; {6534#true} is VALID [2018-11-23 10:32:28,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {6534#true} assume !(0bv32 == ~cond); {6534#true} is VALID [2018-11-23 10:32:28,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {6534#true} ~cond := #in~cond; {6534#true} is VALID [2018-11-23 10:32:28,112 INFO L256 TraceCheckUtils]: 20: Hoare triple {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} call __VERIFIER_assert((if #t~mem8 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {6534#true} is VALID [2018-11-23 10:32:28,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:32:28,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {6785#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} ~i~0 := 0bv32; {6760#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32)))))} is VALID [2018-11-23 10:32:28,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {6785#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32)); {6785#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:32:28,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {6785#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6785#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:32:28,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {6795#(and (= (_ bv16 32) (bvmul (_ bv16 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(4bv32, ~i~0), 1bv32))), 4bv32); {6785#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))))} is VALID [2018-11-23 10:32:28,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret6 := ReadFromPort();~value~0 := #t~ret6;havoc #t~ret6; {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:28,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (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(4bv32, ~i~0), 2bv32))), 4bv32); {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:28,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:28,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {6795#(and (= (_ bv16 32) (bvmul (_ bv16 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(4bv32, ~i~0), 3bv32))), 4bv32); {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:28,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:28,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (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(4bv32, ~i~0), 4bv32))), 4bv32); {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:28,122 INFO L273 TraceCheckUtils]: 8: Hoare triple {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 4bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:28,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {6820#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 4bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 4bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {6795#(and (= (_ bv16 32) (bvmul (_ bv16 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-23 10:32:28,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {6534#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; {6820#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-23 10:32:28,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {6534#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6534#true} is VALID [2018-11-23 10:32:28,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {6534#true} call #t~ret9 := main(); {6534#true} is VALID [2018-11-23 10:32:28,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6534#true} {6534#true} #86#return; {6534#true} is VALID [2018-11-23 10:32:28,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {6534#true} assume true; {6534#true} is VALID [2018-11-23 10:32:28,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {6534#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {6534#true} is VALID [2018-11-23 10:32:28,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {6534#true} call ULTIMATE.init(); {6534#true} is VALID [2018-11-23 10:32:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 10:32:28,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:32:28,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-23 10:32:28,134 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 10:32:28,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:32:28,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 10:32:29,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:32:29,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 10:32:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 10:32:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-11-23 10:32:29,135 INFO L87 Difference]: Start difference. First operand 202 states and 268 transitions. Second operand 23 states.