java -ea -Xmx16000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/memsafety-ext3/freeAlloca_false-valid-free.c -------------------------------------------------------------------------------- ThThis is Ultimate 0.1.23-c6a52e0 [2018-11-19 15:22:07,611 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 15:22:07,613 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 15:22:07,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 15:22:07,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 15:22:07,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 15:22:07,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 15:22:07,628 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 15:22:07,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 15:22:07,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 15:22:07,632 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 15:22:07,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 15:22:07,633 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 15:22:07,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 15:22:07,635 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 15:22:07,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 15:22:07,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 15:22:07,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 15:22:07,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 15:22:07,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 15:22:07,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 15:22:07,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 15:22:07,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 15:22:07,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 15:22:07,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 15:22:07,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 15:22:07,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 15:22:07,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 15:22:07,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 15:22:07,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 15:22:07,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 15:22:07,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 15:22:07,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 15:22:07,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 15:22:07,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 15:22:07,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 15:22:07,655 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-19 15:22:07,670 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 15:22:07,670 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 15:22:07,671 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 15:22:07,672 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 15:22:07,672 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 15:22:07,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 15:22:07,672 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 15:22:07,673 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-19 15:22:07,673 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 15:22:07,673 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 15:22:07,673 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 15:22:07,673 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-19 15:22:07,674 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-19 15:22:07,674 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-19 15:22:07,674 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 15:22:07,674 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-19 15:22:07,674 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-19 15:22:07,675 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 15:22:07,675 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 15:22:07,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 15:22:07,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 15:22:07,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 15:22:07,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 15:22:07,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 15:22:07,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 15:22:07,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 15:22:07,676 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-19 15:22:07,677 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 15:22:07,677 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-19 15:22:07,677 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-19 15:22:07,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 15:22:07,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 15:22:07,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 15:22:07,755 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 15:22:07,755 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 15:22:07,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/[2018-11-19 15:22:08,123 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 15:22:08,124 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext3/freeAlloca_false-valid-free.c [2018-11-19 15:22:08,129 INFO L355 CDTParser]: About to delete temporary [2018-11-19 15:22:08,205 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 15:22:08,205 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext3/freeAlloca_false-valid-free.c [2018-11-19 15:22:08,210 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab221b72/c39c1e98a2864dd6a2d5ff991b5d061b/FLAGa4616ef8f [2018-11-19 15:22:08,223 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab221b72/c39c1e98a2864dd6a2d5ff991b5d061b [2018-11-19 15:22:08,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 15:22:08,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 15:22:08,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 15:22:08,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 15:22:08,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 15:22:08,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:22:08" (1/1) ... [2018-11-19 15:22:08,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13093651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08, skipping insertion in model container [2018-11-19 15:22:08,241 INFO L185 PluginConnector][2018-11-19 15:22:08,394 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 15:22:08,407 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 15:22:08,425 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 15:22:08,444 INFO L195 MainTranslator]: Completed [2018-11-19 15:22:08,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 15:22:08,462 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 15:22:08,478 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 15:22:08,493 INFO L195 MainTranslator]: Completed translation [2018-11-19 15:22:08,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08 WrapperNode [2018-11-19 15:22:08,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 15:22:08,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 15:22:08,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 15:22:08,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 15:22:08,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08" (1/1) ... [2018-11-19 15:22:08,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08" (1/1) ... [2018-11-19 15:22:08,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08" (1/1) ... [2018-11-19 15:22:08,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08" (1/1) ... [2018-11-19 15:22:08,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08" (1/1) ... [2018-11-19 15:22:08,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08" (1/1) ... [2018-11-19 15:22:08,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08" (1/1) ... [2018-11-19 15:22:08,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 15:22:08,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 15:22:08,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 15:22:08,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-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-19 15:22:08,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 15:22:08,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 15:22:08,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 15:22[2018-11-19 15:22:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 15:22:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 15:22:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 15:22:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-19 15:22:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-19 15:22:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-19 15:22:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 15:22:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-19 15:22:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-19 15:22:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-19 15:22:08,640 INFO L130 BoogieDeclarations]: Found specification of proced[2018-11-19 15:22:08,872 INFO L271 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 15:22:08,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:22:08 BoogieIcfgContainer [2018-11-19 15:22:08,873 INFO L132 P[2018-11-19 15:22:08,941 INFO L271 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 15:22:08,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:22:08 BoogieIcfgContainer [2018-11-19 15:22:08,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 15:22:08,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 15:22:08,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 15:22:08,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 15:22:08,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 03:22:08" (1/3) ... [2018-11-19 15:22:08,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cafd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:22:08, skipping insertion in model container [2018-11-19 15:22:08,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:08" (2/3) ... [2018-11-19 15:22:08,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cafd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:22:08, skipping insertion in model container [2018-11-19 15:22:08,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:22:08" (3/3) ... [2018-11-19 15:22:08,950 INFO L112 eAbstractionObserver]: Analyzing ICFG freeAlloca_false-valid-free.c [2018-11-19 15:22:08,959 INFO L147 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 15:22:08,967 INFO L159 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-19 15:22:08,981 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-19 15:22:09,003 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 15:22:09,004 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 15:22:09,004 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-19 15:22:09,004 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 15:22:09,004 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 15:22:09,005 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 15:22:09,005 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 15:22:09,005 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 15:22:09,005 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 15:22:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-19 15:22:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-19 15:22:09,026 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:09,026 INFO L384 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:09,028 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:09,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -746767553, now seen corresponding path program 1 times [2018-11-19 15:22:09,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:09,037 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working[2018-11-19 15:22:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:09,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-19 15:22:09,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-19 15:22:09,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-19 15:22:09,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple[2018-11-19 15:22:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:09,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:09,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-19 15:22:09,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-19 15:22:09,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-19 15:22:09,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #41#return; {30#true} is VALID [2018-11-19 15:22:09,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2018-11-19 15:22:09,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {30#true} is VALID [2018-11-19 15:22:09,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-19 15:22:09,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} assume !(1bv1 == #valid[~p~0.base]); {31#false} is VALID [2018-11-19 15:22:09,154 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-19 15:22:09,154 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:09,157 INFO L312 seRefinementStrategy]: C[2018-11-19 15:22:09,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-19 15:22:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, I[2018-11-19 15:22:09,162 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-19 15:22:09,164 INFO L84 Acc[2018-11-19 15:22:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:09,222 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-19 15:22:09,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-19 15:22:09,222 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-19 15:22:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 15:22:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transition[2018-11-19 15:22:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:09,286 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-19 15:22:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-19 15:22:[2018-11-19 15:22:09,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:09,308 INFO L225 Difference]: With dead ends: 27 [2018-11-19 15:22:09,308 INFO L226 Difference]: Without dead ends: 24 [2018-11-19 15:22:09,310 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-19 15:22:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-19 15:22:09,342 INFO L88 GeneralOperation]: Fini[2018-11-19 15:22:09,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:09,366 INFO L225 Difference]: With dead ends: 27 [2018-11-19 15:22:09,367 INFO L226 Difference]: Without dead ends: 24 [2018-11-19 15:22:09,369 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-19 15:22:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-19 15:22:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-19 15:22:09,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:09,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-19 15:22:09,399 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-19 15:22:09,399 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-19 15:22:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:09,403 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-19 15:22:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-19 15:22:09,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:09,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:09,404 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-19 15:22:09,405 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-19 15:22:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:09,409 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-19 15:22:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-19 15:22:09,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:09,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:09,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:09,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 15:22:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-19 15:22:09,414 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2018-11-19 15:22:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:09,414 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-19 15:22:09,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-19 15:22:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-19 15:22:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-19 15:22:09,415 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:09,415 INFO L384 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:09,416 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:09,416 INFO L141 PredicateUni[2018-11-19 15:22:09,436 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-19 15:22:09,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {133#true} is VALID [2018-11-19 15:22:09,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-19 15:22:09,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {133#true} {133#true} #41#return; {133#true} is VALID [2018-11-19 15:22:09,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {133#true} call #t~ret5 := main(); {133#true} is VALID [2018-11-19 15:22:09,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {133#true} call #t~mallo[2018-11-19 15:22:09,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:09,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:09,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {154#true} is VALID [2018-11-19 15:22:09,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {154#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {154#true} is VALID [2018-11-19 15:22:09,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2018-11-19 15:22:09,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #41#return; {154#true} is VALID [2018-11-19 15:22:09,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret5 := main(); {154#true} is VALID [2018-11-19 15:22:09,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {154#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {174#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:09,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {174#(= main_~i~0 (_ bv0 32))} assume true; {174#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:09,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {174#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 10bv32); {155#false} is VALID [2018-11-19 15:22:09,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {155#false} assume !(1bv1 == #valid[~p~0.base]); {155#false} is VALID [2018-11-19 15:22:09,530 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-19 15:22:09,530 INFO L312 TraceCheckSpWp]: Omiting computation of backwar[2018-11-19 15:22:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:09,534 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-19 15:22:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 15:22:09,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-19 15:22:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:09,535 INFO L82 GeneralOperation]: Start removeUnreachable[2018-11-19 15:22:09,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:09,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 15:22:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 15:22:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 1[2018-11-19 15:22:09,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times[2018-11-19 15:22:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:09,666 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-19 15:22:09,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 15:22:09,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-19 15:22:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-19 15:22:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-19 15:22:09,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2018-11-19 15:22:09,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:09,731 INFO L225 Difference]: With dead ends: 31 [2018-11-19 15:22:09,732 INFO L226 Difference]: Without dead ends: 31 [2018-11-19 15:22:09,733 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-19 15:22:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-19 15:22:09,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:09,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 26 states. [2018-11-19 15:22:09,736 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 26 states. [2018-11-19 15:22:09,737 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 26 states. [2018-11-19 15:22:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:09,740 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-19 15:22:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-19 15:22:09,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:09,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:09,741 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 31 states. [2018-11-19 15:22:09,741 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 31 states. [2018-11-19 15:22:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:09,744 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-19 15:22:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-19 15:22:09,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:09,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:09,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:09,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-19 15:22:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-19 15:22:09,748 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 9 [2018-11-19 15:22:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:09,749 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-19 15:22:09,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 15:22:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-19 15:22:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-19 15:22:09,749 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:09,750 INFO L384 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:09,750 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:09,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:09,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1674970481, now seen corresponding path program 1 times [2018-11-19 15:22:09,751 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:09,751 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-19 15:22:09,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:09,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:09,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-19 15:22:09,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:09,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:09,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-19 15:22:09,846 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:09,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {302#true} call ULTIMATE.init(); {302#true} is VALID [2018-11-19 15:22:09,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {302#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {302#true} is VALID [2018-11-19 15:22:09,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2018-11-19 15:22:09,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {302#true} {302#true} #41#return; {302#true} is VALID [2018-11-19 15:22:09,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {302#true} call #t~ret5 := main(); {302#true} is VALID [2018-11-19 15:22:09,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {302#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {322#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2018-11-19 15:22:09,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {322#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume true; {322#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2018-11-19 15:22:09,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !!~bvslt32(~i~0, 10bv32); {322#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2018-11-19 15:22:09,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {322#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(1bv1 == #valid[~p~0.base]); {303#false} is VALID [2018-11-19 15:22:09,867 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-19 15:22:09,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:09,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:09,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 15:22:09,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-19 15:22:09,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:09,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 15:22:09,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:09,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 15:22:09,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 15:22:09,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:09,899 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 3 states. [2018-11-19 15:22:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:10,016 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-19 15:22:10,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 15:22:10,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-19 15:22:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-19 15:22:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-19 15:22:10,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-11-19 15:22:10,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:10,063 INFO L225 Difference]: With dead ends: 24 [2018-11-19 15:22:10,063 INFO L226 Difference]: Without dead ends: 24 [2018-11-19 15:22:10,063 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-19 15:22:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-19 15:22:10,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:10,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-19 15:22:10,066 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-19 15:22:10,066 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-19 15:22:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:10,068 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-19 15:22:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-19 15:22:10,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:10,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:10,070 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-19 15:22:10,070 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-19 15:22:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:10,072 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-19 15:22:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-19 15:22:10,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:10,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:10,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:10,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 15:22:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-19 15:22:10,075 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 9 [2018-11-19 15:22:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:10,076 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-19 15:22:10,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 15:22:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-19 15:22:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-19 15:22:10,077 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:10,077 INFO L384 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:10,077 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:10,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1674970480, now seen corresponding path program 1 times [2018-11-19 15:22:10,078 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:10,078 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-19 15:22:10,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:10,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:10,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-19 15:22:10,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:10,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:10,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-19 15:22:10,189 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:10,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-19 15:22:10,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {426#true} is VALID [2018-11-19 15:22:10,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-19 15:22:10,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {426#true} {426#true} #41#return; {426#true} is VALID [2018-11-19 15:22:10,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {426#true} call #t~ret5 := main(); {426#true} is VALID [2018-11-19 15:22:10,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {446#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:10,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {446#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {446#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:10,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {446#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {446#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:10,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {446#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)), #length[~p~0.base]) && ~bvsle32(~bvadd32(~p~0.offset, ~i~0), ~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)))) && ~bvsle32(0bv32, ~bvadd32(~p~0.offset, ~i~0))); {427#false} is VALID [2018-11-19 15:22:10,232 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-19 15:22:10,232 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:10,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:10,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 15:22:10,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-19 15:22:10,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:10,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 15:22:10,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:10,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 15:22:10,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 15:22:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:10,255 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2018-11-19 15:22:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:10,379 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-19 15:22:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 15:22:10,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-19 15:22:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-19 15:22:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-19 15:22:10,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2018-11-19 15:22:10,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:10,428 INFO L225 Difference]: With dead ends: 26 [2018-11-19 15:22:10,429 INFO L226 Difference]: Without dead ends: 26 [2018-11-19 15:22:10,429 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-19 15:22:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-19 15:22:10,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:10,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-19 15:22:10,432 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-19 15:22:10,432 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-19 15:22:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:10,434 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-19 15:22:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-19 15:22:10,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:10,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:10,435 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-19 15:22:10,435 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-19 15:22:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:10,437 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-19 15:22:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-19 15:22:10,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:10,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:10,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:10,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 15:22:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-19 15:22:10,440 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 9 [2018-11-19 15:22:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:10,440 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-19 15:22:10,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 15:22:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-19 15:22:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-19 15:22:10,441 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:10,441 INFO L384 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:10,442 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:10,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash 609832967, now seen corresponding path program 1 times [2018-11-19 15:22:10,443 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:10,443 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-19 15:22:10,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:10,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:10,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2018-11-19 15:22:10,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {557#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {557#true} is VALID [2018-11-19 15:22:10,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {557#true} assume true; {557#true} is VALID [2018-11-19 15:22:10,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {557#true} {557#true} #41#return; {557#true} is VALID [2018-11-19 15:22:10,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {557#true} call #t~ret5 := main(); {557#true} is VALID [2018-11-19 15:22:10,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {557#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {577#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:10,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {577#(= main_~i~0 (_ bv0 32))} assume true; {577#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:10,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {577#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10bv32); {577#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:10,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {577#(= main_~i~0 (_ bv0 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {577#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:10,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {577#(= main_~i~0 (_ bv0 32))} havoc #t~nondet3; {577#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:10,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {577#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {593#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:10,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {593#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {593#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:10,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {593#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10bv32); {558#false} is VALID [2018-11-19 15:22:10,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {558#false} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(2bv32, ~p~0.offset)), #length[~p~0.base]) && ~bvsle32(~bvadd32(2bv32, ~p~0.offset), ~bvadd32(1bv32, ~bvadd32(2bv32, ~p~0.offset)))) && ~bvsle32(0bv32, ~bvadd32(2bv32, ~p~0.offset))); {558#false} is VALID [2018-11-19 15:22:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 15:22:10,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-19 15:22:10,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {558#false} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(2bv32, ~p~0.offset)), #length[~p~0.base]) && ~bvsle32(~bvadd32(2bv32, ~p~0.offset), ~bvadd32(1bv32, ~bvadd32(2bv32, ~p~0.offset)))) && ~bvsle32(0bv32, ~bvadd32(2bv32, ~p~0.offset))); {558#false} is VALID [2018-11-19 15:22:10,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {606#(bvslt main_~i~0 (_ bv10 32))} assume !~bvslt32(~i~0, 10bv32); {558#false} is VALID [2018-11-19 15:22:10,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {606#(bvslt main_~i~0 (_ bv10 32))} assume true; {606#(bvslt main_~i~0 (_ bv10 32))} is VALID [2018-11-19 15:22:10,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {606#(bvslt main_~i~0 (_ bv10 32))} is VALID [2018-11-19 15:22:10,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} havoc #t~nondet3; {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:10,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:10,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32); {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:10,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} assume true; {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:10,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {557#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {613#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:10,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {557#true} call #t~ret5 := main(); {557#true} is VALID [2018-11-19 15:22:10,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {557#true} {557#true} #41#return; {557#true} is VALID [2018-11-19 15:22:10,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {557#true} assume true; {557#true} is VALID [2018-11-19 15:22:10,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {557#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {557#true} is VALID [2018-11-19 15:22:10,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2018-11-19 15:22:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 15:22:10,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 15:22:10,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-19 15:22:10,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-19 15:22:10,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:10,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 15:22:10,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:10,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 15:22:10,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 15:22:10,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-19 15:22:10,662 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-19 15:22:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:10,948 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-19 15:22:10,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 15:22:10,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-19 15:22:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 15:22:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-19 15:22:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 15:22:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-19 15:22:10,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2018-11-19 15:22:11,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:11,057 INFO L225 Difference]: With dead ends: 40 [2018-11-19 15:22:11,058 INFO L226 Difference]: Without dead ends: 40 [2018-11-19 15:22:11,058 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-19 15:22:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-19 15:22:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-19 15:22:11,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:11,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-19 15:22:11,061 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-19 15:22:11,061 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-19 15:22:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:11,063 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-19 15:22:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-19 15:22:11,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:11,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:11,064 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-19 15:22:11,064 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-19 15:22:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:11,067 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-19 15:22:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-19 15:22:11,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:11,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:11,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:11,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-19 15:22:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-19 15:22:11,069 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-11-19 15:22:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:11,069 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-19 15:22:11,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 15:22:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-19 15:22:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-19 15:22:11,070 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:11,070 INFO L384 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:11,070 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:11,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:11,071 INFO L82 PathProgramCache]: Analyzing trace with hash 609833020, now seen corresponding path program 1 times [2018-11-19 15:22:11,071 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:11,071 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-19 15:22:11,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:11,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:11,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-19 15:22:11,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:11,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:11,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-19 15:22:11,156 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:11,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {806#true} call ULTIMATE.init(); {806#true} is VALID [2018-11-19 15:22:11,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {806#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {806#true} is VALID [2018-11-19 15:22:11,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {806#true} assume true; {806#true} is VALID [2018-11-19 15:22:11,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {806#true} {806#true} #41#return; {806#true} is VALID [2018-11-19 15:22:11,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {806#true} call #t~ret5 := main(); {806#true} is VALID [2018-11-19 15:22:11,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {806#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:11,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:11,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:11,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:11,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:11,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {826#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {842#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:11,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {842#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {842#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:11,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {842#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {842#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:11,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {842#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)), #length[~p~0.base]) && ~bvsle32(~bvadd32(~p~0.offset, ~i~0), ~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)))) && ~bvsle32(0bv32, ~bvadd32(~p~0.offset, ~i~0))); {807#false} is VALID [2018-11-19 15:22:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 15:22:11,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-19 15:22:11,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {852#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)), #length[~p~0.base]) && ~bvsle32(~bvadd32(~p~0.offset, ~i~0), ~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)))) && ~bvsle32(0bv32, ~bvadd32(~p~0.offset, ~i~0))); {807#false} is VALID [2018-11-19 15:22:11,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {852#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} assume !!~bvslt32(~i~0, 10bv32); {852#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} is VALID [2018-11-19 15:22:11,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {852#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} assume true; {852#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} is VALID [2018-11-19 15:22:12,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {852#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} is VALID [2018-11-19 15:22:12,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} havoc #t~nondet3; {862#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} is VALID [2018-11-19 15:22:12,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {869#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {862#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} is VALID [2018-11-19 15:22:12,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {869#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} assume !!~bvslt32(~i~0, 10bv32); {869#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} is VALID [2018-11-19 15:22:12,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {869#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} assume true; {869#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} is VALID [2018-11-19 15:22:12,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {806#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {869#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} is VALID [2018-11-19 15:22:12,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {806#true} call #t~ret5 := main(); {806#true} is VALID [2018-11-19 15:22:12,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {806#true} {806#true} #41#return; {806#true} is VALID [2018-11-19 15:22:12,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {806#true} assume true; {806#true} is VALID [2018-11-19 15:22:12,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {806#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {806#true} is VALID [2018-11-19 15:22:12,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {806#true} call ULTIMATE.init(); {806#true} is VALID [2018-11-19 15:22:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 15:22:12,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 15:22:12,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-11-19 15:22:12,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-19 15:22:12,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:12,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-19 15:22:12,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:12,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-19 15:22:12,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-19 15:22:12,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-19 15:22:12,678 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-11-19 15:22:13,056 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-19 15:22:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:13,464 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-19 15:22:13,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 15:22:13,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-19 15:22:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 15:22:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-19 15:22:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 15:22:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-19 15:22:13,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2018-11-19 15:22:14,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:14,158 INFO L225 Difference]: With dead ends: 39 [2018-11-19 15:22:14,158 INFO L226 Difference]: Without dead ends: 39 [2018-11-19 15:22:14,159 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-19 15:22:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-19 15:22:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-19 15:22:14,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:14,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-19 15:22:14,162 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-19 15:22:14,162 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-19 15:22:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:14,164 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-19 15:22:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-19 15:22:14,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:14,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:14,165 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-19 15:22:14,165 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-19 15:22:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:14,168 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-19 15:22:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-19 15:22:14,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:14,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:14,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:14,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-19 15:22:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-19 15:22:14,171 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 14 [2018-11-19 15:22:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:14,171 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-19 15:22:14,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-19 15:22:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-19 15:22:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-19 15:22:14,172 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:14,173 INFO L384 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:14,173 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:14,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash 369553755, now seen corresponding path program 2 times [2018-11-19 15:22:14,174 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:14,174 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-19 15:22:14,193 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-19 15:22:14,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-19 15:22:14,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 15:22:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:14,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:14,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-19 15:22:14,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:14,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:14,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-19 15:22:14,263 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:14,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {1054#true} call ULTIMATE.init(); {1054#true} is VALID [2018-11-19 15:22:14,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {1054#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1054#true} is VALID [2018-11-19 15:22:14,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {1054#true} assume true; {1054#true} is VALID [2018-11-19 15:22:14,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1054#true} {1054#true} #41#return; {1054#true} is VALID [2018-11-19 15:22:14,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {1054#true} call #t~ret5 := main(); {1054#true} is VALID [2018-11-19 15:22:14,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {1054#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,337 INFO L273 TraceCheckUtils]: 16: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,338 INFO L273 TraceCheckUtils]: 17: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,340 INFO L273 TraceCheckUtils]: 19: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,343 INFO L273 TraceCheckUtils]: 23: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, 10bv32); {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {1074#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(2bv32, ~p~0.offset)), #length[~p~0.base]) && ~bvsle32(~bvadd32(2bv32, ~p~0.offset), ~bvadd32(1bv32, ~bvadd32(2bv32, ~p~0.offset)))) && ~bvsle32(0bv32, ~bvadd32(2bv32, ~p~0.offset))); {1055#false} is VALID [2018-11-19 15:22:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-19 15:22:14,353 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:14,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:14,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 15:22:14,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-19 15:22:14,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:14,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 15:22:14,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:14,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 15:22:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 15:22:14,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:14,386 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 3 states. [2018-11-19 15:22:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:14,443 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-19 15:22:14,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 15:22:14,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-19 15:22:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-19 15:22:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-19 15:22:14,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-19 15:22:14,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:14,479 INFO L225 Difference]: With dead ends: 37 [2018-11-19 15:22:14,480 INFO L226 Difference]: Without dead ends: 37 [2018-11-19 15:22:14,480 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-19 15:22:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-19 15:22:14,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:14,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-19 15:22:14,483 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-19 15:22:14,483 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-19 15:22:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:14,485 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-19 15:22:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-19 15:22:14,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:14,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:14,486 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-19 15:22:14,486 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-19 15:22:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:14,488 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-19 15:22:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-19 15:22:14,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:14,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:14,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:14,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-19 15:22:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-19 15:22:14,490 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 29 [2018-11-19 15:22:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:14,491 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-19 15:22:14,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 15:22:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-19 15:22:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-19 15:22:14,492 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:14,492 INFO L384 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:14,492 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:14,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:14,492 INFO L82 PathProgramCache]: Analyzing trace with hash 369553808, now seen corresponding path program 2 times [2018-11-19 15:22:14,493 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:14,493 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-19 15:22:14,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 15:22:14,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 15:22:14,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 15:22:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:14,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:14,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-19 15:22:14,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:14,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:14,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-19 15:22:14,619 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:14,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {1291#true} call ULTIMATE.init(); {1291#true} is VALID [2018-11-19 15:22:14,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {1291#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1291#true} is VALID [2018-11-19 15:22:14,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {1291#true} assume true; {1291#true} is VALID [2018-11-19 15:22:14,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1291#true} {1291#true} #41#return; {1291#true} is VALID [2018-11-19 15:22:14,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {1291#true} call #t~ret5 := main(); {1291#true} is VALID [2018-11-19 15:22:14,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {1291#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {1311#(and (= main_~p~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~nondet3; {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {1327#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,828 INFO L273 TraceCheckUtils]: 17: Hoare triple {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {1343#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {1359#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1375#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv4 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {1375#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv4 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {1375#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv4 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {1375#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv4 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {1375#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv4 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:14,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {1375#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv4 32) main_~i~0) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)), #length[~p~0.base]) && ~bvsle32(~bvadd32(~p~0.offset, ~i~0), ~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)))) && ~bvsle32(0bv32, ~bvadd32(~p~0.offset, ~i~0))); {1292#false} is VALID [2018-11-19 15:22:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 15:22:14,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-19 15:22:16,052 INFO L273 TraceCheckUtils]: 28: Hoare triple {1385#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)), #length[~p~0.base]) && ~bvsle32(~bvadd32(~p~0.offset, ~i~0), ~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)))) && ~bvsle32(0bv32, ~bvadd32(~p~0.offset, ~i~0))); {1292#false} is VALID [2018-11-19 15:22:16,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {1385#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} assume !!~bvslt32(~i~0, 10bv32); {1385#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} is VALID [2018-11-19 15:22:16,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {1385#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} assume true; {1385#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} is VALID [2018-11-19 15:22:16,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1385#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvsle (bvadd main_~i~0 main_~p~0.offset) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base)))} is VALID [2018-11-19 15:22:16,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} havoc #t~nondet3; {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} is VALID [2018-11-19 15:22:16,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} is VALID [2018-11-19 15:22:16,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} assume !!~bvslt32(~i~0, 10bv32); {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} is VALID [2018-11-19 15:22:16,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} assume true; {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} is VALID [2018-11-19 15:22:16,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1395#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv1 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))))} is VALID [2018-11-19 15:22:16,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} havoc #t~nondet3; {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:16,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:16,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} assume !!~bvslt32(~i~0, 10bv32); {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:16,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} assume true; {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:17,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1411#(and (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv2 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv2 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:17,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} havoc #t~nondet3; {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:17,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:17,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} assume !!~bvslt32(~i~0, 10bv32); {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:17,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} assume true; {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:18,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {1443#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1427#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv3 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv3 32))))} is VALID [2018-11-19 15:22:18,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {1443#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))))} havoc #t~nondet3; {1443#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))))} is VALID [2018-11-19 15:22:18,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {1450#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1443#(and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32))))} is VALID [2018-11-19 15:22:18,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {1450#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} assume !!~bvslt32(~i~0, 10bv32); {1450#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} is VALID [2018-11-19 15:22:18,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {1450#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} assume true; {1450#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} is VALID [2018-11-19 15:22:18,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {1291#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {1450#(or (and (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv5 32)) (select |#length| main_~p~0.base)) (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)) (bvadd main_~i~0 main_~p~0.offset (_ bv5 32))) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4 32)))) (not (bvsle (bvadd main_~i~0 main_~p~0.offset (_ bv1 32)) (select |#length| main_~p~0.base))))} is VALID [2018-11-19 15:22:18,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {1291#true} call #t~ret5 := main(); {1291#true} is VALID [2018-11-19 15:22:18,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1291#true} {1291#true} #41#return; {1291#true} is VALID [2018-11-19 15:22:18,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {1291#true} assume true; {1291#true} is VALID [2018-11-19 15:22:18,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {1291#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1291#true} is VALID [2018-11-19 15:22:18,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {1291#true} call ULTIMATE.init(); {1291#true} is VALID [2018-11-19 15:22:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 15:22:18,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 15:22:18,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-11-19 15:22:18,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-19 15:22:18,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:18,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-19 15:22:21,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:21,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-19 15:22:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-19 15:22:21,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-19 15:22:21,259 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-11-19 15:22:22,573 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 16 [2018-11-19 15:22:24,639 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2018-11-19 15:22:26,864 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-19 15:22:28,135 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-19 15:22:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:29,153 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-19 15:22:29,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-19 15:22:29,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-19 15:22:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 15:22:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2018-11-19 15:22:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 15:22:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2018-11-19 15:22:29,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 115 transitions. [2018-11-19 15:22:32,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:32,060 INFO L225 Difference]: With dead ends: 102 [2018-11-19 15:22:32,060 INFO L226 Difference]: Without dead ends: 102 [2018-11-19 15:22:32,061 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2018-11-19 15:22:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-19 15:22:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2018-11-19 15:22:32,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:32,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 67 states. [2018-11-19 15:22:32,066 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 67 states. [2018-11-19 15:22:32,066 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 67 states. [2018-11-19 15:22:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:32,070 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-19 15:22:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-11-19 15:22:32,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:32,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:32,071 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 102 states. [2018-11-19 15:22:32,071 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 102 states. [2018-11-19 15:22:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:32,074 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-19 15:22:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-11-19 15:22:32,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:32,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:32,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:32,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-19 15:22:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-11-19 15:22:32,077 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 29 [2018-11-19 15:22:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:32,078 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-19 15:22:32,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-19 15:22:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-19 15:22:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-19 15:22:32,079 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:32,079 INFO L384 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:32,079 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:32,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:32,080 INFO L82 PathProgramCache]: Analyzing trace with hash -631409440, now seen corresponding path program 1 times [2018-11-19 15:22:32,080 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:32,080 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-19 15:22:32,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 15:22:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:32,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:32,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {1858#true} call ULTIMATE.init(); {1858#true} is VALID [2018-11-19 15:22:32,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {1858#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1858#true} is VALID [2018-11-19 15:22:32,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {1858#true} assume true; {1858#true} is VALID [2018-11-19 15:22:32,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1858#true} {1858#true} #41#return; {1858#true} is VALID [2018-11-19 15:22:32,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {1858#true} call #t~ret5 := main(); {1858#true} is VALID [2018-11-19 15:22:32,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {1858#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {1878#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:32,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {1878#(= main_~i~0 (_ bv0 32))} assume true; {1878#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:32,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {1878#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10bv32); {1878#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:32,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {1878#(= main_~i~0 (_ bv0 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1878#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:32,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {1878#(= main_~i~0 (_ bv0 32))} havoc #t~nondet3; {1878#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-19 15:22:32,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {1878#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10bv32); {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} havoc #t~nondet3; {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1910#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-19 15:22:32,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {1910#(= (_ bv2 32) main_~i~0)} assume true; {1910#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-19 15:22:32,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {1910#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 10bv32); {1910#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-19 15:22:32,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {1910#(= (_ bv2 32) main_~i~0)} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1910#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-19 15:22:32,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {1910#(= (_ bv2 32) main_~i~0)} havoc #t~nondet3; {1910#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-19 15:22:32,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {1910#(= (_ bv2 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10bv32); {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} havoc #t~nondet3; {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {1926#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1942#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-19 15:22:32,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {1942#(= (_ bv4 32) main_~i~0)} assume true; {1942#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-19 15:22:32,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {1942#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 10bv32); {1942#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-19 15:22:32,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {1942#(= (_ bv4 32) main_~i~0)} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1942#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-19 15:22:32,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {1942#(= (_ bv4 32) main_~i~0)} havoc #t~nondet3; {1942#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-19 15:22:32,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {1942#(= (_ bv4 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1958#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {1958#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1958#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-19 15:22:32,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {1958#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10bv32); {1859#false} is VALID [2018-11-19 15:22:32,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {1859#false} SUMMARY for call #t~mem4 := read~intINTTYPE1(~p~0.base, ~bvadd32(2bv32, ~p~0.offset), 1bv32); srcloc: L8-5 {1859#false} is VALID [2018-11-19 15:22:32,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {1859#false} assume !(97bv32 == ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {1859#false} is VALID [2018-11-19 15:22:32,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {1859#false} #res := 0bv32;call ULTIMATE.dealloc(#t~malloc1.base, #t~malloc1.offset);havoc #t~malloc1.base, #t~malloc1.offset; {1859#false} is VALID [2018-11-19 15:22:32,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {1859#false} assume !(#valid == old(#valid)); {1859#false} is VALID [2018-11-19 15:22:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 15:22:32,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-19 15:22:32,612 INFO L273 TraceCheckUtils]: 36: Hoare triple {1859#false} assume !(#valid == old(#valid)); {1859#false} is VALID [2018-11-19 15:22:32,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {1859#false} #res := 0bv32;call ULTIMATE.dealloc(#t~malloc1.base, #t~malloc1.offset);havoc #t~malloc1.base, #t~malloc1.offset; {1859#false} is VALID [2018-11-19 15:22:32,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {1859#false} assume !(97bv32 == ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {1859#false} is VALID [2018-11-19 15:22:32,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {1859#false} SUMMARY for call #t~mem4 := read~intINTTYPE1(~p~0.base, ~bvadd32(2bv32, ~p~0.offset), 1bv32); srcloc: L8-5 {1859#false} is VALID [2018-11-19 15:22:32,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {1989#(bvslt main_~i~0 (_ bv10 32))} assume !~bvslt32(~i~0, 10bv32); {1859#false} is VALID [2018-11-19 15:22:32,614 INFO L273 TraceCheckUtils]: 31: Hoare triple {1989#(bvslt main_~i~0 (_ bv10 32))} assume true; {1989#(bvslt main_~i~0 (_ bv10 32))} is VALID [2018-11-19 15:22:32,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1989#(bvslt main_~i~0 (_ bv10 32))} is VALID [2018-11-19 15:22:32,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} havoc #t~nondet3; {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32); {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} assume true; {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,621 INFO L273 TraceCheckUtils]: 25: Hoare triple {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1996#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,622 INFO L273 TraceCheckUtils]: 24: Hoare triple {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} havoc #t~nondet3; {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,623 INFO L273 TraceCheckUtils]: 23: Hoare triple {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,623 INFO L273 TraceCheckUtils]: 22: Hoare triple {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32); {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} assume true; {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2012#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} havoc #t~nondet3; {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32); {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,630 INFO L273 TraceCheckUtils]: 16: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} assume true; {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2028#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} havoc #t~nondet3; {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32); {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} assume true; {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2044#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} havoc #t~nondet3; {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32); {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} assume true; {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {1858#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {2060#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10 32))} is VALID [2018-11-19 15:22:32,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {1858#true} call #t~ret5 := main(); {1858#true} is VALID [2018-11-19 15:22:32,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1858#true} {1858#true} #41#return; {1858#true} is VALID [2018-11-19 15:22:32,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {1858#true} assume true; {1858#true} is VALID [2018-11-19 15:22:32,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {1858#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1858#true} is VALID [2018-11-19 15:22:32,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {1858#true} call ULTIMATE.init(); {1858#true} is VALID [2018-11-19 15:22:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 15:22:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 15:22:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-19 15:22:32,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-19 15:22:32,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:32,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-19 15:22:32,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:32,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-19 15:22:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-19 15:22:32,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-19 15:22:32,753 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 14 states. [2018-11-19 15:22:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:33,756 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-19 15:22:33,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-19 15:22:33,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-19 15:22:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-19 15:22:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-19 15:22:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-19 15:22:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-19 15:22:33,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2018-11-19 15:22:33,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:33,883 INFO L225 Difference]: With dead ends: 67 [2018-11-19 15:22:33,883 INFO L226 Difference]: Without dead ends: 67 [2018-11-19 15:22:33,883 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-11-19 15:22:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-19 15:22:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-19 15:22:33,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:33,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-19 15:22:33,886 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-19 15:22:33,886 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-19 15:22:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:33,888 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-19 15:22:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-19 15:22:33,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:33,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:33,889 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-19 15:22:33,889 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-19 15:22:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:33,890 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-19 15:22:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-19 15:22:33,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:33,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:33,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:33,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-19 15:22:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-11-19 15:22:33,893 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 37 [2018-11-19 15:22:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:33,893 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-19 15:22:33,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-19 15:22:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-19 15:22:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-19 15:22:33,894 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:33,894 INFO L384 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:33,894 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:33,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2086638608, now seen corresponding path program 3 times [2018-11-19 15:22:33,895 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:33,895 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-19 15:22:33,909 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-19 15:22:33,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-19 15:22:33,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 15:22:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:33,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:34,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-19 15:22:34,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:34,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:34,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-19 15:22:34,029 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:34,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {2367#true} call ULTIMATE.init(); {2367#true} is VALID [2018-11-19 15:22:34,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {2367#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2367#true} is VALID [2018-11-19 15:22:34,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {2367#true} assume true; {2367#true} is VALID [2018-11-19 15:22:34,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2367#true} {2367#true} #41#return; {2367#true} is VALID [2018-11-19 15:22:34,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {2367#true} call #t~ret5 := main(); {2367#true} is VALID [2018-11-19 15:22:34,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {2367#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,390 INFO L273 TraceCheckUtils]: 31: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,391 INFO L273 TraceCheckUtils]: 32: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,399 INFO L273 TraceCheckUtils]: 36: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,399 INFO L273 TraceCheckUtils]: 37: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,400 INFO L273 TraceCheckUtils]: 38: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,400 INFO L273 TraceCheckUtils]: 39: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,401 INFO L273 TraceCheckUtils]: 40: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,401 INFO L273 TraceCheckUtils]: 41: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,402 INFO L273 TraceCheckUtils]: 42: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,403 INFO L273 TraceCheckUtils]: 43: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,407 INFO L273 TraceCheckUtils]: 48: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,407 INFO L273 TraceCheckUtils]: 49: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,408 INFO L273 TraceCheckUtils]: 50: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {2387#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2529#(and (= main_~p~0.offset (_ bv0 32)) (bvslt main_~i~0 (_ bv10 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {2529#(and (= main_~p~0.offset (_ bv0 32)) (bvslt main_~i~0 (_ bv10 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2533#(and (= main_~p~0.offset (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvslt main_~i~0 (_ bv10 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,411 INFO L273 TraceCheckUtils]: 54: Hoare triple {2533#(and (= main_~p~0.offset (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvslt main_~i~0 (_ bv10 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} havoc #t~nondet3; {2533#(and (= main_~p~0.offset (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvslt main_~i~0 (_ bv10 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,414 INFO L273 TraceCheckUtils]: 55: Hoare triple {2533#(and (= main_~p~0.offset (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset)) (bvslt main_~i~0 (_ bv10 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2540#(and (= main_~p~0.offset (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv10 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4294967295 32))) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,416 INFO L273 TraceCheckUtils]: 56: Hoare triple {2540#(and (= main_~p~0.offset (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv10 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4294967295 32))) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2540#(and (= main_~p~0.offset (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv10 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4294967295 32))) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {2540#(and (= main_~p~0.offset (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv10 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4294967295 32))) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 10bv32); {2547#(and (= main_~p~0.offset (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv10 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4294967295 32))) (bvslt main_~i~0 (_ bv10 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-19 15:22:34,420 INFO L273 TraceCheckUtils]: 58: Hoare triple {2547#(and (= main_~p~0.offset (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv10 32)) (bvsle (_ bv0 32) (bvadd main_~i~0 main_~p~0.offset (_ bv4294967295 32))) (bvslt main_~i~0 (_ bv10 32)) (= (bvadd (select |#length| main_~p~0.base) (_ bv4294967286 32)) (_ bv0 32)))} assume !((~bvsle32(~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)), #length[~p~0.base]) && ~bvsle32(~bvadd32(~p~0.offset, ~i~0), ~bvadd32(1bv32, ~bvadd32(~p~0.offset, ~i~0)))) && ~bvsle32(0bv32, ~bvadd32(~p~0.offset, ~i~0))); {2368#false} is VALID [2018-11-19 15:22:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-19 15:22:34,431 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:34,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:34,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 15:22:34,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-11-19 15:22:34,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:34,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-19 15:22:34,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:34,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-19 15:22:34,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-19 15:22:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-19 15:22:34,463 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 7 states. [2018-11-19 15:22:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:34,649 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-19 15:22:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-19 15:22:34,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-11-19 15:22:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 15:22:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-19 15:22:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 15:22:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-19 15:22:34,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2018-11-19 15:22:34,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:34,702 INFO L225 Difference]: With dead ends: 66 [2018-11-19 15:22:34,702 INFO L226 Difference]: Without dead ends: 66 [2018-11-19 15:22:34,703 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-19 15:22:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-19 15:22:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-19 15:22:34,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:34,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-19 15:22:34,706 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-19 15:22:34,706 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-19 15:22:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:34,709 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-19 15:22:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-19 15:22:34,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:34,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:34,710 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-19 15:22:34,710 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-19 15:22:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:34,712 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-19 15:22:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-19 15:22:34,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:34,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:34,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:34,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-19 15:22:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-19 15:22:34,714 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2018-11-19 15:22:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:34,714 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-19 15:22:34,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-19 15:22:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-19 15:22:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-19 15:22:34,715 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:34,715 INFO L384 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:34,716 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:34,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1987492236, now seen corresponding path program 2 times [2018-11-19 15:22:34,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:34,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-19 15:22:34,732 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-19 15:22:34,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-19 15:22:34,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 15:22:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:34,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:34,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-19 15:22:34,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:34,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:34,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-19 15:22:34,807 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:35,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {2813#true} call ULTIMATE.init(); {2813#true} is VALID [2018-11-19 15:22:35,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {2813#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2821#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} is VALID [2018-11-19 15:22:35,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {2821#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} assume true; {2821#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} is VALID [2018-11-19 15:22:35,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2821#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} {2813#true} #41#return; {2821#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} is VALID [2018-11-19 15:22:35,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {2821#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} call #t~ret5 := main(); {2831#(and (= |#valid| |old(#valid)|) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {2831#(and (= |#valid| |old(#valid)|) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,021 INFO L273 TraceCheckUtils]: 25: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,022 INFO L273 TraceCheckUtils]: 27: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,029 INFO L273 TraceCheckUtils]: 34: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,031 INFO L273 TraceCheckUtils]: 37: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,033 INFO L273 TraceCheckUtils]: 40: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,034 INFO L273 TraceCheckUtils]: 41: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,034 INFO L273 TraceCheckUtils]: 42: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,035 INFO L273 TraceCheckUtils]: 43: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,036 INFO L273 TraceCheckUtils]: 44: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,037 INFO L273 TraceCheckUtils]: 45: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,037 INFO L273 TraceCheckUtils]: 46: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,038 INFO L273 TraceCheckUtils]: 47: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,039 INFO L273 TraceCheckUtils]: 48: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,039 INFO L273 TraceCheckUtils]: 49: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,040 INFO L273 TraceCheckUtils]: 50: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,041 INFO L273 TraceCheckUtils]: 51: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,041 INFO L273 TraceCheckUtils]: 52: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,042 INFO L273 TraceCheckUtils]: 53: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,043 INFO L273 TraceCheckUtils]: 54: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,044 INFO L273 TraceCheckUtils]: 55: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,044 INFO L273 TraceCheckUtils]: 56: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !~bvslt32(~i~0, 10bv32); {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,046 INFO L273 TraceCheckUtils]: 58: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call #t~mem4 := read~intINTTYPE1(~p~0.base, ~bvadd32(2bv32, ~p~0.offset), 1bv32); srcloc: L8-5 {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,047 INFO L273 TraceCheckUtils]: 59: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !(97bv32 == ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,048 INFO L273 TraceCheckUtils]: 60: Hoare triple {2835#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #res := 0bv32;call ULTIMATE.dealloc(#t~malloc1.base, #t~malloc1.offset);havoc #t~malloc1.base, #t~malloc1.offset; {2831#(and (= |#valid| |old(#valid)|) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {2831#(and (= |#valid| |old(#valid)|) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !(#valid == old(#valid)); {2814#false} is VALID [2018-11-19 15:22:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-19 15:22:35,063 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:35,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:35,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-19 15:22:35,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-19 15:22:35,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:35,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 15:22:35,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:35,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 15:22:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 15:22:35,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-19 15:22:35,086 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 5 states. [2018-11-19 15:22:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:35,243 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-19 15:22:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-19 15:22:35,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-19 15:22:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:35,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 15:22:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-19 15:22:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 15:22:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-19 15:22:35,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2018-11-19 15:22:35,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:35,273 INFO L225 Difference]: With dead ends: 67 [2018-11-19 15:22:35,273 INFO L226 Difference]: Without dead ends: 65 [2018-11-19 15:22:35,274 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-19 15:22:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-19 15:22:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-19 15:22:35,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:35,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-19 15:22:35,277 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-19 15:22:35,277 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-19 15:22:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:35,279 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-19 15:22:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-19 15:22:35,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:35,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:35,279 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-19 15:22:35,280 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-19 15:22:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:35,281 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-19 15:22:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-19 15:22:35,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:35,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:35,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:35,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-19 15:22:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-19 15:22:35,283 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-11-19 15:22:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:35,283 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-19 15:22:35,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 15:22:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-19 15:22:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-19 15:22:35,284 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:35,284 INFO L384 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 15:22:35,284 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-19 15:22:35,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1286132376, now seen corresponding path program 1 times [2018-11-19 15:22:35,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:35,285 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-19 15:22:35,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 15:22:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:35,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:35,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-19 15:22:35,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:35,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:35,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-19 15:22:35,478 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:35,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {3267#true} call ULTIMATE.init(); {3267#true} is VALID [2018-11-19 15:22:35,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {3267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3275#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} is VALID [2018-11-19 15:22:35,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {3275#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} assume true; {3275#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} is VALID [2018-11-19 15:22:35,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3275#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} {3267#true} #41#return; {3275#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} is VALID [2018-11-19 15:22:35,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {3275#(= (select |#valid| (_ bv0 32)) (_ bv0 1))} call #t~ret5 := main(); {3285#(and (= |#valid| |old(#valid)|) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {3285#(and (= |#valid| |old(#valid)|) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(10bv32);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0bv32; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,756 INFO L273 TraceCheckUtils]: 30: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,757 INFO L273 TraceCheckUtils]: 32: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,759 INFO L273 TraceCheckUtils]: 35: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,760 INFO L273 TraceCheckUtils]: 36: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,763 INFO L273 TraceCheckUtils]: 40: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,764 INFO L273 TraceCheckUtils]: 41: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,765 INFO L273 TraceCheckUtils]: 42: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,765 INFO L273 TraceCheckUtils]: 43: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,766 INFO L273 TraceCheckUtils]: 44: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,767 INFO L273 TraceCheckUtils]: 45: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,768 INFO L273 TraceCheckUtils]: 47: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,769 INFO L273 TraceCheckUtils]: 49: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,770 INFO L273 TraceCheckUtils]: 50: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,771 INFO L273 TraceCheckUtils]: 52: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !!~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,774 INFO L273 TraceCheckUtils]: 53: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call write~intINTTYPE1(#t~nondet3, ~p~0.base, ~bvadd32(~p~0.offset, ~i~0), 1bv32); srcloc: L9 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,776 INFO L273 TraceCheckUtils]: 54: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} havoc #t~nondet3; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,777 INFO L273 TraceCheckUtils]: 55: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,777 INFO L273 TraceCheckUtils]: 56: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume true; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,778 INFO L273 TraceCheckUtils]: 57: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !~bvslt32(~i~0, 10bv32); {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,779 INFO L273 TraceCheckUtils]: 58: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} SUMMARY for call #t~mem4 := read~intINTTYPE1(~p~0.base, ~bvadd32(2bv32, ~p~0.offset), 1bv32); srcloc: L8-5 {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,780 INFO L273 TraceCheckUtils]: 59: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume 97bv32 == ~sign_extendFrom8To32(#t~mem4);havoc #t~mem4; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,780 INFO L273 TraceCheckUtils]: 60: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume 0bv32 == ~p~0.offset; {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {3289#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv1 1))) (= |main_#t~malloc1.base| main_~p~0.base) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume 0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {3458#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,783 INFO L273 TraceCheckUtils]: 62: Hoare triple {3458#(and (= |#valid| (store |old(#valid)| |main_#t~malloc1.base| (_ bv0 1))) (= (_ bv0 1) (select |old(#valid)| |main_#t~malloc1.base|)) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} #res := 0bv32;call ULTIMATE.dealloc(#t~malloc1.base, #t~malloc1.offset);havoc #t~malloc1.base, #t~malloc1.offset; {3285#(and (= |#valid| |old(#valid)|) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} is VALID [2018-11-19 15:22:35,784 INFO L273 TraceCheckUtils]: 63: Hoare triple {3285#(and (= |#valid| |old(#valid)|) (= (_ bv0 1) (select |old(#valid)| (_ bv0 32))))} assume !(#valid == old(#valid)); {3268#false} is VALID [2018-11-19 15:22:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-19 15:22:35,801 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:35,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:35,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-19 15:22:35,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-19 15:22:35,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:35,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 15:22:35,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:35,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 15:22:35,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 15:22:35,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-19 15:22:35,833 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 6 states. [2018-11-19 15:22:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:36,034 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-19 15:22:36,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 15:22:36,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-19 15:22:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 15:22:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-19 15:22:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 15:22:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-19 15:22:36,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2018-11-19 15:22:36,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:36,060 INFO L225 Difference]: With dead ends: 64 [2018-11-19 15:22:36,060 INFO L226 Difference]: Without dead ends: 0 [2018-11-19 15:22:36,061 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-19 15:22:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-19 15:22:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-19 15:22:36,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:36,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-19 15:22:36,061 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 15:22:36,061 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 15:22:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:36,062 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 15:22:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 15:22:36,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:36,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:36,062 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 15:22:36,062 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 15:22:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:36,063 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 15:22:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 15:22:36,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:36,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:36,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:36,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-19 15:22:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-19 15:22:36,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-11-19 15:22:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:36,064 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-19 15:22:36,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 15:22:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 15:22:36,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:36,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 03:22:36 BoogieIcfgContainer [2018-11-19 15:22:36,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-19 15:22:36,069 INFO L168 Benchmark]: Toolchain (without parser) took 27837.11 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -405.4 MB). Peak memory consumption was 462.8 MB. Max. memory is 14.2 GB. [2018-11-19 15:22:36,070 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 14.2 GB. [2018-11-19 15:22:36,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.2 GB. [2018-11-19 15:22:36,071 INFO L168 Benchmark]: Boogie Preprocessor took 41.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 14.2 GB. [2018-11-19 15:22:36,071 INFO L168 Benchmark]: RCFGBuilder took 405.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -751.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 14.2 GB. [2018-11-19 15:22:36,072 INFO L168 Benchmark]: TraceAbstraction took 27125.38 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 151.0 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 335.7 MB). Peak memory consumption was 486.7 MB. Max. memory is 14.2 GB. [2018-11-19 15:22:36,074 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 260.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 405.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -751.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 27125.38 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 151.0 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 335.7 MB). Peak memory consumption was 486.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 5]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 7 error locations. SAFE Result, 27.0s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 312 SDslu, 443 SDs, 0 SdLazy, 464 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 373 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 46 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 343 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 421 ConstructedInterpolants, 0 QuantifiedInterpolants, 218565 SizeOfPredicates, 17 NumberOfNonLiveVariables, 608 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 783/997 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...