java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:06:43,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:06:43,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:06:43,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:06:43,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:06:43,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:06:43,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:06:43,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:06:43,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:06:43,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:06:43,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:06:43,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:06:43,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:06:43,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:06:43,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:06:43,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:06:43,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:06:43,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:06:43,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:06:43,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:06:43,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:06:43,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:06:43,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:06:43,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:06:43,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:06:43,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:06:43,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:06:43,330 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:06:43,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:06:43,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:06:43,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:06:43,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:06:43,333 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:06:43,333 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:06:43,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:06:43,335 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:06:43,335 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:06:43,351 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:06:43,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:06:43,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:06:43,352 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:06:43,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:06:43,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:06:43,353 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:06:43,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:06:43,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:06:43,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:06:43,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:06:43,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:06:43,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:06:43,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:06:43,355 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:06:43,355 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:06:43,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:06:43,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:06:43,355 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:06:43,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:06:43,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:06:43,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:06:43,356 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:06:43,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:06:43,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:06:43,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:06:43,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:06:43,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:06:43,357 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:06:43,358 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:06:43,358 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:06:43,358 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:06:43,358 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:06:43,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:06:43,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:06:43,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:06:43,440 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:06:43,440 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:06:43,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-11-23 11:06:43,510 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d09c8f/2531e6cd1c674ca0bb8bcc63a0145427/FLAGe94ebaacd [2018-11-23 11:06:43,985 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:06:43,987 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-11-23 11:06:44,007 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d09c8f/2531e6cd1c674ca0bb8bcc63a0145427/FLAGe94ebaacd [2018-11-23 11:06:44,315 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d09c8f/2531e6cd1c674ca0bb8bcc63a0145427 [2018-11-23 11:06:44,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:06:44,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:06:44,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:44,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:06:44,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:06:44,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:44" (1/1) ... [2018-11-23 11:06:44,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c03eec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:44, skipping insertion in model container [2018-11-23 11:06:44,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:44" (1/1) ... [2018-11-23 11:06:44,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:06:44,419 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:06:44,867 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:44,876 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:06:44,928 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:45,003 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:06:45,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45 WrapperNode [2018-11-23 11:06:45,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:45,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:45,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:06:45,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:06:45,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:45,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:06:45,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:06:45,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:06:45,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:06:45,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:06:45,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:06:45,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:06:45,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:06:45,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:06:45,242 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2018-11-23 11:06:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2018-11-23 11:06:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:06:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:06:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:06:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:06:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-23 11:06:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-23 11:06:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:06:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 11:06:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 11:06:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-11-23 11:06:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-11-23 11:06:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2018-11-23 11:06:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2018-11-23 11:06:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:06:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:06:46,047 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:06:46,048 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:06:46,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:46 BoogieIcfgContainer [2018-11-23 11:06:46,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:06:46,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:06:46,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:06:46,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:06:46,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:06:44" (1/3) ... [2018-11-23 11:06:46,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7558f9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:46, skipping insertion in model container [2018-11-23 11:06:46,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45" (2/3) ... [2018-11-23 11:06:46,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7558f9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:46, skipping insertion in model container [2018-11-23 11:06:46,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:46" (3/3) ... [2018-11-23 11:06:46,057 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_true-unreach-call.i [2018-11-23 11:06:46,068 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:06:46,077 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:06:46,096 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:06:46,130 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:06:46,131 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:06:46,131 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:06:46,132 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:06:46,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:06:46,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:06:46,132 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:06:46,133 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:06:46,133 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:06:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-23 11:06:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:06:46,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:46,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:46,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:46,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:46,175 INFO L82 PathProgramCache]: Analyzing trace with hash 379458140, now seen corresponding path program 1 times [2018-11-23 11:06:46,180 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:46,182 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:46,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:46,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:46,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {49#true} is VALID [2018-11-23 11:06:46,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {49#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {49#true} is VALID [2018-11-23 11:06:46,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {49#true} assume true; {49#true} is VALID [2018-11-23 11:06:46,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49#true} {49#true} #71#return; {49#true} is VALID [2018-11-23 11:06:46,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {49#true} call #t~ret34 := main(); {49#true} is VALID [2018-11-23 11:06:46,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {49#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {49#true} is VALID [2018-11-23 11:06:46,522 INFO L256 TraceCheckUtils]: 6: Hoare triple {49#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {72#(= (bvadd |my_malloc_#in~size| (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:46,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {72#(= (bvadd |my_malloc_#in~size| (_ bv4294967288 32)) (_ bv0 32))} ~size := #in~size; {76#(= (bvadd my_malloc_~size (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:46,525 INFO L256 TraceCheckUtils]: 8: Hoare triple {76#(= (bvadd my_malloc_~size (_ bv4294967288 32)) (_ bv0 32))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {80#(= (_ bv8 32) |__getMemory_#in~size|)} is VALID [2018-11-23 11:06:46,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {80#(= (_ bv8 32) |__getMemory_#in~size|)} ~size := #in~size; {84#(= (_ bv8 32) __getMemory_~size)} is VALID [2018-11-23 11:06:46,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {84#(= (_ bv8 32) __getMemory_~size)} assume !~bvsgt32(~size, 0bv32); {50#false} is VALID [2018-11-23 11:06:46,543 INFO L256 TraceCheckUtils]: 11: Hoare triple {50#false} call __blast_assert(); {50#false} is VALID [2018-11-23 11:06:46,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {50#false} assume !false; {50#false} is VALID [2018-11-23 11:06:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:46,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:06:46,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:46,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:06:46,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:06:46,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:46,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:06:46,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:46,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:06:46,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:06:46,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:06:46,650 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2018-11-23 11:06:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:48,039 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-23 11:06:48,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:06:48,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:06:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:06:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2018-11-23 11:06:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:06:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2018-11-23 11:06:48,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2018-11-23 11:06:48,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:48,474 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:06:48,474 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:06:48,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:06:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:06:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 11:06:48,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:48,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 11:06:48,782 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:06:48,782 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:06:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:48,789 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 11:06:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:06:48,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:48,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:48,791 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:06:48,791 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:06:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:48,797 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 11:06:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:06:48,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:48,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:48,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:48,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:06:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 11:06:48,809 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 13 [2018-11-23 11:06:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:48,810 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 11:06:48,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:06:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:06:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:06:48,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:48,813 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:48,813 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:48,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash 63162368, now seen corresponding path program 1 times [2018-11-23 11:06:48,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:48,821 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:48,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:48,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:49,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-23 11:06:49,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {340#true} #71#return; {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret34 := main(); {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,584 INFO L256 TraceCheckUtils]: 6: Hoare triple {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,585 INFO L273 TraceCheckUtils]: 7: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,587 INFO L256 TraceCheckUtils]: 8: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume ~bvsgt32(~size, 0bv32); {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} assume true; {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,611 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #67#return; {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} assume true; {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,616 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} {348#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #75#return; {399#(and (= (_ bv1 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {399#(and (= (_ bv1 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {399#(and (= (_ bv1 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,619 INFO L256 TraceCheckUtils]: 19: Hoare triple {399#(and (= (_ bv1 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,621 INFO L273 TraceCheckUtils]: 20: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,623 INFO L256 TraceCheckUtils]: 21: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,626 INFO L273 TraceCheckUtils]: 23: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume ~bvsgt32(~size, 0bv32); {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {380#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {424#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {424#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {424#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,652 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {424#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {364#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #67#return; {431#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {431#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {435#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {435#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {435#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,658 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {435#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {399#(and (= (_ bv1 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #77#return; {442#(and (= (bvadd |main_#t~ret33.offset| (_ bv4294967294 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {442#(and (= (bvadd |main_#t~ret33.offset| (_ bv4294967294 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {446#(and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:49,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {446#(and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {446#(and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:49,662 INFO L256 TraceCheckUtils]: 33: Hoare triple {446#(and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {453#(and (= ~elem~0.offset (_ bv0 32)) (= (_ bv2 32) |list_add_#in~new.offset|))} is VALID [2018-11-23 11:06:49,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {453#(and (= ~elem~0.offset (_ bv0 32)) (= (_ bv2 32) |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {457#(and (= (_ bv2 32) list_add_~new.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:49,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {457#(and (= (_ bv2 32) list_add_~new.offset) (= ~elem~0.offset (_ bv0 32)))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {341#false} is VALID [2018-11-23 11:06:49,669 INFO L256 TraceCheckUtils]: 36: Hoare triple {341#false} call __blast_assert(); {341#false} is VALID [2018-11-23 11:06:49,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-23 11:06:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:06:49,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:49,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:49,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 11:06:49,690 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-23 11:06:49,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:49,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:06:49,818 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-23 11:06:49,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:06:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:06:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:06:49,819 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 13 states. [2018-11-23 11:06:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:52,777 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-11-23 11:06:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:06:52,778 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-23 11:06:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:06:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 96 transitions. [2018-11-23 11:06:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:06:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 96 transitions. [2018-11-23 11:06:52,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 96 transitions. [2018-11-23 11:06:53,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:53,016 INFO L225 Difference]: With dead ends: 85 [2018-11-23 11:06:53,016 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:06:53,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:06:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:06:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2018-11-23 11:06:53,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:53,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 66 states. [2018-11-23 11:06:53,121 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 66 states. [2018-11-23 11:06:53,121 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 66 states. [2018-11-23 11:06:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:53,128 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 11:06:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-11-23 11:06:53,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:53,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:53,130 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 76 states. [2018-11-23 11:06:53,130 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 76 states. [2018-11-23 11:06:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:53,136 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 11:06:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-11-23 11:06:53,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:53,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:53,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:53,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:06:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-11-23 11:06:53,143 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 38 [2018-11-23 11:06:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:53,144 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-11-23 11:06:53,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:06:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-23 11:06:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:06:53,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:53,146 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:53,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:53,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:53,147 INFO L82 PathProgramCache]: Analyzing trace with hash 356565375, now seen corresponding path program 1 times [2018-11-23 11:06:53,147 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:53,148 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:53,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:53,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:53,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2018-11-23 11:06:53,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {840#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {840#true} is VALID [2018-11-23 11:06:53,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-23 11:06:53,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #71#return; {840#true} is VALID [2018-11-23 11:06:53,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret34 := main(); {840#true} is VALID [2018-11-23 11:06:53,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {840#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {840#true} is VALID [2018-11-23 11:06:53,545 INFO L256 TraceCheckUtils]: 6: Hoare triple {840#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {840#true} is VALID [2018-11-23 11:06:53,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {840#true} ~size := #in~size; {840#true} is VALID [2018-11-23 11:06:53,546 INFO L256 TraceCheckUtils]: 8: Hoare triple {840#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {840#true} is VALID [2018-11-23 11:06:53,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {840#true} ~size := #in~size; {840#true} is VALID [2018-11-23 11:06:53,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {840#true} assume ~bvsgt32(~size, 0bv32); {840#true} is VALID [2018-11-23 11:06:53,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {840#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {840#true} is VALID [2018-11-23 11:06:53,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {840#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {840#true} is VALID [2018-11-23 11:06:53,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-23 11:06:53,548 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {840#true} {840#true} #67#return; {840#true} is VALID [2018-11-23 11:06:53,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {840#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {840#true} is VALID [2018-11-23 11:06:53,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-23 11:06:53,549 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {840#true} {840#true} #75#return; {840#true} is VALID [2018-11-23 11:06:53,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {840#true} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {840#true} is VALID [2018-11-23 11:06:53,549 INFO L256 TraceCheckUtils]: 19: Hoare triple {840#true} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {840#true} is VALID [2018-11-23 11:06:53,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {840#true} ~size := #in~size; {840#true} is VALID [2018-11-23 11:06:53,550 INFO L256 TraceCheckUtils]: 21: Hoare triple {840#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {840#true} is VALID [2018-11-23 11:06:53,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {840#true} ~size := #in~size; {840#true} is VALID [2018-11-23 11:06:53,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {840#true} assume ~bvsgt32(~size, 0bv32); {840#true} is VALID [2018-11-23 11:06:53,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {840#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {840#true} is VALID [2018-11-23 11:06:53,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {840#true} assume 0bv32 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0bv32, 0bv32; {920#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:06:53,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {920#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} assume true; {920#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:06:53,555 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {920#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} {840#true} #67#return; {927#(and (= |my_malloc_#t~ret30.offset| (_ bv0 32)) (= (_ bv0 32) |my_malloc_#t~ret30.base|))} is VALID [2018-11-23 11:06:53,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {927#(and (= |my_malloc_#t~ret30.offset| (_ bv0 32)) (= (_ bv0 32) |my_malloc_#t~ret30.base|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {931#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} is VALID [2018-11-23 11:06:53,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {931#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} assume true; {931#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} is VALID [2018-11-23 11:06:53,566 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {931#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} {840#true} #77#return; {938#(and (= |main_#t~ret33.base| (_ bv0 32)) (= |main_#t~ret33.offset| (_ bv0 32)))} is VALID [2018-11-23 11:06:53,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {938#(and (= |main_#t~ret33.base| (_ bv0 32)) (= |main_#t~ret33.offset| (_ bv0 32)))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {942#(and (= main_~dev2~0.offset (_ bv0 32)) (= main_~dev2~0.base (_ bv0 32)))} is VALID [2018-11-23 11:06:53,567 INFO L273 TraceCheckUtils]: 32: Hoare triple {942#(and (= main_~dev2~0.offset (_ bv0 32)) (= main_~dev2~0.base (_ bv0 32)))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {841#false} is VALID [2018-11-23 11:06:53,567 INFO L256 TraceCheckUtils]: 33: Hoare triple {841#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {841#false} is VALID [2018-11-23 11:06:53,568 INFO L273 TraceCheckUtils]: 34: Hoare triple {841#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {841#false} is VALID [2018-11-23 11:06:53,568 INFO L273 TraceCheckUtils]: 35: Hoare triple {841#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {841#false} is VALID [2018-11-23 11:06:53,568 INFO L256 TraceCheckUtils]: 36: Hoare triple {841#false} call __blast_assert(); {841#false} is VALID [2018-11-23 11:06:53,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {841#false} assume !false; {841#false} is VALID [2018-11-23 11:06:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:06:53,572 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:53,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:53,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:06:53,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-23 11:06:53,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:53,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:06:53,629 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-23 11:06:53,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:06:53,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:06:53,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:06:53,630 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 7 states. [2018-11-23 11:06:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:54,500 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-11-23 11:06:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:06:54,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-23 11:06:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:06:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-23 11:06:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:06:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-23 11:06:54,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2018-11-23 11:06:54,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:54,679 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:06:54,679 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:06:54,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:06:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:06:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-11-23 11:06:54,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:54,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 58 states. [2018-11-23 11:06:54,787 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 58 states. [2018-11-23 11:06:54,787 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 58 states. [2018-11-23 11:06:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:54,792 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-23 11:06:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-23 11:06:54,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:54,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:54,793 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 63 states. [2018-11-23 11:06:54,793 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 63 states. [2018-11-23 11:06:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:54,798 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-23 11:06:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-23 11:06:54,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:54,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:54,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:54,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:06:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-11-23 11:06:54,803 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 38 [2018-11-23 11:06:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:54,803 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-23 11:06:54,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:06:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 11:06:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:06:54,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:54,805 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:54,806 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:54,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:54,806 INFO L82 PathProgramCache]: Analyzing trace with hash 384292520, now seen corresponding path program 1 times [2018-11-23 11:06:54,807 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:54,807 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:54,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:54,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:55,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1284#true} is VALID [2018-11-23 11:06:55,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {1284#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} assume true; {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,529 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} {1284#true} #71#return; {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} call #t~ret34 := main(); {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,531 INFO L256 TraceCheckUtils]: 6: Hoare triple {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,532 INFO L256 TraceCheckUtils]: 8: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {1324#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:06:55,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {1324#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {1328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {1328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,559 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {1335#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {1335#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {1339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {1339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,565 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} {1292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} #75#return; {1346#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {1346#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {1350#(and (= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:55,568 INFO L256 TraceCheckUtils]: 19: Hoare triple {1350#(and (= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,568 INFO L273 TraceCheckUtils]: 20: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,569 INFO L256 TraceCheckUtils]: 21: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:55,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {1324#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:06:55,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {1324#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {1328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {1328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,594 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {1335#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {1335#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {1339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {1339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:55,596 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} {1350#(and (= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} #77#return; {1387#(and (= (bvadd |main_#t~ret33.offset| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:55,599 INFO L273 TraceCheckUtils]: 31: Hoare triple {1387#(and (= (bvadd |main_#t~ret33.offset| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {1391#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:55,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {1391#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {1391#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:55,615 INFO L256 TraceCheckUtils]: 33: Hoare triple {1391#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1284#true} is VALID [2018-11-23 11:06:55,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {1284#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1401#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:06:55,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {1401#(= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1401#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:06:55,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {1401#(= list_add_~new.offset |list_add_#in~new.offset|)} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {1408#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:06:55,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {1408#(= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {1408#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:06:55,622 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1408#(= ~elem~0.offset |list_add_#in~new.offset|)} {1391#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} #79#return; {1415#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:55,626 INFO L256 TraceCheckUtils]: 39: Hoare triple {1415#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {1419#(and (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) |list_add_#in~new.offset|))} is VALID [2018-11-23 11:06:55,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {1419#(and (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1423#(and (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) list_add_~new.offset))} is VALID [2018-11-23 11:06:55,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {1423#(and (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) list_add_~new.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1285#false} is VALID [2018-11-23 11:06:55,628 INFO L256 TraceCheckUtils]: 42: Hoare triple {1285#false} call __blast_assert(); {1285#false} is VALID [2018-11-23 11:06:55,628 INFO L273 TraceCheckUtils]: 43: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2018-11-23 11:06:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:06:55,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:06:57,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2018-11-23 11:06:57,151 INFO L256 TraceCheckUtils]: 42: Hoare triple {1285#false} call __blast_assert(); {1285#false} is VALID [2018-11-23 11:06:57,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {1439#(not (= ~elem~0.offset list_add_~new.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1285#false} is VALID [2018-11-23 11:06:57,153 INFO L273 TraceCheckUtils]: 40: Hoare triple {1443#(not (= ~elem~0.offset |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1439#(not (= ~elem~0.offset list_add_~new.offset))} is VALID [2018-11-23 11:06:57,154 INFO L256 TraceCheckUtils]: 39: Hoare triple {1447#(not (= ~elem~0.offset main_~dev1~0.offset))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {1443#(not (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:06:57,156 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1408#(= ~elem~0.offset |list_add_#in~new.offset|)} {1451#(not (= main_~dev1~0.offset main_~dev2~0.offset))} #79#return; {1447#(not (= ~elem~0.offset main_~dev1~0.offset))} is VALID [2018-11-23 11:06:57,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {1408#(= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {1408#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:06:57,157 INFO L273 TraceCheckUtils]: 36: Hoare triple {1401#(= list_add_~new.offset |list_add_#in~new.offset|)} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {1408#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:06:57,158 INFO L273 TraceCheckUtils]: 35: Hoare triple {1401#(= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {1401#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:06:57,161 INFO L273 TraceCheckUtils]: 34: Hoare triple {1284#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1401#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:06:57,162 INFO L256 TraceCheckUtils]: 33: Hoare triple {1451#(not (= main_~dev1~0.offset main_~dev2~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1284#true} is VALID [2018-11-23 11:06:57,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {1451#(not (= main_~dev1~0.offset main_~dev2~0.offset))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {1451#(not (= main_~dev1~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:06:57,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {1473#(not (= main_~dev1~0.offset |main_#t~ret33.offset|))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {1451#(not (= main_~dev1~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:06:57,164 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1481#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} {1477#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} #77#return; {1473#(not (= main_~dev1~0.offset |main_#t~ret33.offset|))} is VALID [2018-11-23 11:06:57,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {1481#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume true; {1481#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:06:57,178 INFO L273 TraceCheckUtils]: 28: Hoare triple {1488#(= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) |my_malloc_#t~ret30.offset|)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1481#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:06:57,193 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1495#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {1488#(= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) |my_malloc_#t~ret30.offset|)} is VALID [2018-11-23 11:06:57,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {1495#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume true; {1495#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:06:57,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {1324#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1495#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:06:57,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {1324#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:06:57,217 INFO L273 TraceCheckUtils]: 23: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:57,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:57,218 INFO L256 TraceCheckUtils]: 21: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:57,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:57,219 INFO L256 TraceCheckUtils]: 19: Hoare triple {1477#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {1308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:06:57,220 INFO L273 TraceCheckUtils]: 18: Hoare triple {1517#(not (= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {1477#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:57,221 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1524#(not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} {1284#true} #75#return; {1517#(not (= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:57,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {1524#(not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} assume true; {1524#(not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:57,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {1531#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) |my_malloc_#t~ret30.offset|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1524#(not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:57,248 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1538#(not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} {1284#true} #67#return; {1531#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) |my_malloc_#t~ret30.offset|))} is VALID [2018-11-23 11:06:57,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {1538#(not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} assume true; {1538#(not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:57,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {1284#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1538#(not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:06:57,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {1284#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {1284#true} is VALID [2018-11-23 11:06:57,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {1284#true} assume ~bvsgt32(~size, 0bv32); {1284#true} is VALID [2018-11-23 11:06:57,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {1284#true} ~size := #in~size; {1284#true} is VALID [2018-11-23 11:06:57,250 INFO L256 TraceCheckUtils]: 8: Hoare triple {1284#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {1284#true} is VALID [2018-11-23 11:06:57,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#true} ~size := #in~size; {1284#true} is VALID [2018-11-23 11:06:57,250 INFO L256 TraceCheckUtils]: 6: Hoare triple {1284#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {1284#true} is VALID [2018-11-23 11:06:57,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {1284#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {1284#true} is VALID [2018-11-23 11:06:57,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {1284#true} call #t~ret34 := main(); {1284#true} is VALID [2018-11-23 11:06:57,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1284#true} {1284#true} #71#return; {1284#true} is VALID [2018-11-23 11:06:57,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {1284#true} assume true; {1284#true} is VALID [2018-11-23 11:06:57,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {1284#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {1284#true} is VALID [2018-11-23 11:06:57,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1284#true} is VALID [2018-11-23 11:06:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:57,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:06:57,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 30 [2018-11-23 11:06:57,266 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-11-23 11:06:57,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:57,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:06:57,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:57,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:06:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:06:57,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:06:57,449 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 30 states. [2018-11-23 11:07:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:04,716 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-23 11:07:04,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:07:04,716 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-11-23 11:07:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:07:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 83 transitions. [2018-11-23 11:07:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:07:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 83 transitions. [2018-11-23 11:07:04,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 83 transitions. [2018-11-23 11:07:04,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:04,959 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:07:04,959 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:07:04,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:07:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:07:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-11-23 11:07:05,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:05,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 76 states. [2018-11-23 11:07:05,202 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 76 states. [2018-11-23 11:07:05,203 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 76 states. [2018-11-23 11:07:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:05,209 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-23 11:07:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-23 11:07:05,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:05,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:05,210 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 80 states. [2018-11-23 11:07:05,211 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 80 states. [2018-11-23 11:07:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:05,215 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-23 11:07:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-23 11:07:05,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:05,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:05,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:05,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:07:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2018-11-23 11:07:05,221 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 44 [2018-11-23 11:07:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:05,221 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2018-11-23 11:07:05,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:07:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2018-11-23 11:07:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:07:05,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:05,223 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:05,224 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:05,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1900570935, now seen corresponding path program 1 times [2018-11-23 11:07:05,224 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:05,225 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:05,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:05,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {1976#true} call ULTIMATE.init(); {1976#true} is VALID [2018-11-23 11:07:05,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {1976#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {1976#true} #71#return; {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret34 := main(); {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,947 INFO L256 TraceCheckUtils]: 6: Hoare triple {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,949 INFO L256 TraceCheckUtils]: 8: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume ~bvsgt32(~size, 0bv32); {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {2016#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {2016#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} assume 0bv32 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0bv32, 0bv32; {2020#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {2020#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} assume true; {2020#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,966 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2020#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #67#return; {2027#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {2027#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2031#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= (_ bv0 32) |my_malloc_#res.offset|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,969 INFO L273 TraceCheckUtils]: 16: Hoare triple {2031#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= (_ bv0 32) |my_malloc_#res.offset|) (= ~elem~0.offset (_ bv0 32)))} assume true; {2031#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= (_ bv0 32) |my_malloc_#res.offset|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,971 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2031#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= (_ bv0 32) |my_malloc_#res.offset|) (= ~elem~0.offset (_ bv0 32)))} {1984#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #75#return; {2038#(and (= ~elem~0.offset (_ bv0 32)) (= |main_#t~ret32.offset| (_ bv0 32)) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:05,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {2038#(and (= ~elem~0.offset (_ bv0 32)) (= |main_#t~ret32.offset| (_ bv0 32)) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {2042#(and (= main_~dev1~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:05,973 INFO L256 TraceCheckUtils]: 19: Hoare triple {2042#(and (= main_~dev1~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,974 INFO L256 TraceCheckUtils]: 21: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,976 INFO L273 TraceCheckUtils]: 23: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume ~bvsgt32(~size, 0bv32); {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,989 INFO L273 TraceCheckUtils]: 24: Hoare triple {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {2016#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,989 INFO L273 TraceCheckUtils]: 25: Hoare triple {2016#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2064#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:05,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {2064#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {2064#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:06,001 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2064#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {2000#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #67#return; {2071#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:06,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {2071#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2075#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:06,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {2075#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {2075#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:06,003 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2075#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {2042#(and (= main_~dev1~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} #77#return; {2082#(and (= main_~dev1~0.offset (_ bv0 32)) (= (bvadd |main_#t~ret33.offset| (_ bv4294967294 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:06,003 INFO L273 TraceCheckUtils]: 31: Hoare triple {2082#(and (= main_~dev1~0.offset (_ bv0 32)) (= (bvadd |main_#t~ret33.offset| (_ bv4294967294 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {2086#(and (= main_~dev1~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:06,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {2086#(and (= main_~dev1~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {2086#(and (= main_~dev1~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:06,004 INFO L256 TraceCheckUtils]: 33: Hoare triple {2086#(and (= main_~dev1~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1976#true} is VALID [2018-11-23 11:07:06,004 INFO L273 TraceCheckUtils]: 34: Hoare triple {1976#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2096#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:06,005 INFO L273 TraceCheckUtils]: 35: Hoare triple {2096#(= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {2096#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:06,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {2096#(= list_add_~new.offset |list_add_#in~new.offset|)} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {2103#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:06,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {2103#(= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {2103#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:06,008 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2103#(= ~elem~0.offset |list_add_#in~new.offset|)} {2086#(and (= main_~dev1~0.offset (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} #79#return; {2110#(and (= main_~dev1~0.offset (_ bv0 32)) (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:06,010 INFO L256 TraceCheckUtils]: 39: Hoare triple {2110#(and (= main_~dev1~0.offset (_ bv0 32)) (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {2114#(and (= (_ bv0 32) |list_add_#in~new.offset|) (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:06,011 INFO L273 TraceCheckUtils]: 40: Hoare triple {2114#(and (= (_ bv0 32) |list_add_#in~new.offset|) (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2118#(and (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) list_add_~new.offset))} is VALID [2018-11-23 11:07:06,012 INFO L273 TraceCheckUtils]: 41: Hoare triple {2118#(and (= (bvadd ~elem~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) list_add_~new.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1977#false} is VALID [2018-11-23 11:07:06,012 INFO L256 TraceCheckUtils]: 42: Hoare triple {1977#false} call __blast_assert(); {1977#false} is VALID [2018-11-23 11:07:06,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {1977#false} assume !false; {1977#false} is VALID [2018-11-23 11:07:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:07:06,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:07,833 INFO L273 TraceCheckUtils]: 43: Hoare triple {1977#false} assume !false; {1977#false} is VALID [2018-11-23 11:07:07,834 INFO L256 TraceCheckUtils]: 42: Hoare triple {1977#false} call __blast_assert(); {1977#false} is VALID [2018-11-23 11:07:07,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {2134#(not (= ~elem~0.offset list_add_~new.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {1977#false} is VALID [2018-11-23 11:07:07,836 INFO L273 TraceCheckUtils]: 40: Hoare triple {2138#(not (= ~elem~0.offset |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2134#(not (= ~elem~0.offset list_add_~new.offset))} is VALID [2018-11-23 11:07:07,837 INFO L256 TraceCheckUtils]: 39: Hoare triple {2142#(not (= ~elem~0.offset main_~dev1~0.offset))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {2138#(not (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:07:07,838 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2103#(= ~elem~0.offset |list_add_#in~new.offset|)} {2146#(not (= main_~dev1~0.offset main_~dev2~0.offset))} #79#return; {2142#(not (= ~elem~0.offset main_~dev1~0.offset))} is VALID [2018-11-23 11:07:07,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {2103#(= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {2103#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:07,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {2096#(= list_add_~new.offset |list_add_#in~new.offset|)} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {2103#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:07,843 INFO L273 TraceCheckUtils]: 35: Hoare triple {2096#(= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {2096#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:07,844 INFO L273 TraceCheckUtils]: 34: Hoare triple {1976#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {2096#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:07,844 INFO L256 TraceCheckUtils]: 33: Hoare triple {2146#(not (= main_~dev1~0.offset main_~dev2~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {1976#true} is VALID [2018-11-23 11:07:07,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {2146#(not (= main_~dev1~0.offset main_~dev2~0.offset))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {2146#(not (= main_~dev1~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:07:07,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {2168#(not (= main_~dev1~0.offset |main_#t~ret33.offset|))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {2146#(not (= main_~dev1~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:07:07,846 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2176#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} {2172#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} #77#return; {2168#(not (= main_~dev1~0.offset |main_#t~ret33.offset|))} is VALID [2018-11-23 11:07:07,846 INFO L273 TraceCheckUtils]: 29: Hoare triple {2176#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume true; {2176#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:07,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {2183#(= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) |my_malloc_#t~ret30.offset|)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2176#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:07,874 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2191#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {2183#(= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) |my_malloc_#t~ret30.offset|)} is VALID [2018-11-23 11:07:07,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {2191#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume true; {2191#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:07,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {2198#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2191#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:07,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {2198#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:07,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:07,897 INFO L273 TraceCheckUtils]: 22: Hoare triple {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:07,897 INFO L256 TraceCheckUtils]: 21: Hoare triple {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:07,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:07,898 INFO L256 TraceCheckUtils]: 19: Hoare triple {2172#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {2187#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:07,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {2214#(not (= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {2172#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:07,900 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2222#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} #75#return; {2214#(not (= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:07,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {2222#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} assume true; {2222#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:07,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {2229#(or (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) |my_malloc_#t~ret30.offset|)) (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2222#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:07,934 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2237#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} #67#return; {2229#(or (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) |my_malloc_#t~ret30.offset|)) (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:07,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {2237#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} assume true; {2237#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:07,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {2244#(or (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32))) (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|))} assume 0bv32 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0bv32, 0bv32; {2237#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:07,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {2244#(or (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32))) (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:07,939 INFO L273 TraceCheckUtils]: 10: Hoare triple {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} assume ~bvsgt32(~size, 0bv32); {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:07:07,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} ~size := #in~size; {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:07:07,944 INFO L256 TraceCheckUtils]: 8: Hoare triple {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:07:07,945 INFO L273 TraceCheckUtils]: 7: Hoare triple {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} ~size := #in~size; {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:07:07,946 INFO L256 TraceCheckUtils]: 6: Hoare triple {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {2233#(or (= (_ bv4294967294 32) |old(~guard_malloc_counter~0.offset)|) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:07:07,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:07,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} call #t~ret34 := main(); {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:07,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} {1976#true} #71#return; {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:07,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} assume true; {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:07,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {1976#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {2218#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:07,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {1976#true} call ULTIMATE.init(); {1976#true} is VALID [2018-11-23 11:07:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:07,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:07,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2018-11-23 11:07:07,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2018-11-23 11:07:07,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:07,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:07:08,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:08,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:07:08,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:07:08,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:07:08,197 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 38 states. [2018-11-23 11:07:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:22,897 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2018-11-23 11:07:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 11:07:22,897 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2018-11-23 11:07:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:07:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 146 transitions. [2018-11-23 11:07:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:07:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 146 transitions. [2018-11-23 11:07:22,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 146 transitions. [2018-11-23 11:07:23,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:23,259 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:07:23,259 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 11:07:23,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=478, Invalid=4924, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 11:07:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 11:07:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-11-23 11:07:23,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:23,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 86 states. [2018-11-23 11:07:23,445 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 86 states. [2018-11-23 11:07:23,445 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 86 states. [2018-11-23 11:07:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:23,451 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-11-23 11:07:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2018-11-23 11:07:23,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:23,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:23,453 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 121 states. [2018-11-23 11:07:23,453 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 121 states. [2018-11-23 11:07:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:23,458 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-11-23 11:07:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2018-11-23 11:07:23,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:23,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:23,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:23,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 11:07:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-11-23 11:07:23,463 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 44 [2018-11-23 11:07:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:23,464 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-11-23 11:07:23,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:07:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-11-23 11:07:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:07:23,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:23,465 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:23,466 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:23,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:23,466 INFO L82 PathProgramCache]: Analyzing trace with hash -425054106, now seen corresponding path program 1 times [2018-11-23 11:07:23,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:23,467 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:23,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:23,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:24,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {2901#true} call ULTIMATE.init(); {2901#true} is VALID [2018-11-23 11:07:24,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {2901#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {2901#true} #71#return; {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret34 := main(); {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,126 INFO L256 TraceCheckUtils]: 6: Hoare triple {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,128 INFO L256 TraceCheckUtils]: 8: Hoare triple {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,129 INFO L273 TraceCheckUtils]: 9: Hoare triple {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} ~size := #in~size; {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume ~bvsgt32(~size, 0bv32); {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {2941#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {2941#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset (_ bv0 32)))} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2945#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {2945#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {2945#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,150 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2945#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {2925#(and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #67#return; {2952#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {2952#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2956#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {2956#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} assume true; {2956#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,152 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2956#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} {2909#(and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32)))} #75#return; {2963#(and (= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,153 INFO L273 TraceCheckUtils]: 18: Hoare triple {2963#(and (= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,153 INFO L256 TraceCheckUtils]: 19: Hoare triple {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} ~size := #in~size; {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,154 INFO L256 TraceCheckUtils]: 21: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} ~size := #in~size; {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,155 INFO L273 TraceCheckUtils]: 23: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} assume ~bvsgt32(~size, 0bv32); {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,156 INFO L273 TraceCheckUtils]: 25: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} assume true; {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,158 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2971#(= ~elem~0.offset (_ bv0 32))} {2971#(= ~elem~0.offset (_ bv0 32))} #67#return; {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,159 INFO L273 TraceCheckUtils]: 28: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {2971#(= ~elem~0.offset (_ bv0 32))} assume true; {2971#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:07:24,161 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2971#(= ~elem~0.offset (_ bv0 32))} {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} #77#return; {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,164 INFO L256 TraceCheckUtils]: 33: Hoare triple {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:24,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:24,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:24,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:24,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} assume true; {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:24,168 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} #79#return; {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,169 INFO L256 TraceCheckUtils]: 39: Hoare triple {2967#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset (_ bv0 32)))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {3033#(and (= (_ bv1 32) |list_add_#in~new.offset|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {3033#(and (= (_ bv1 32) |list_add_#in~new.offset|) (= ~elem~0.offset (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3037#(and (= (_ bv1 32) list_add_~new.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:24,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {3037#(and (= (_ bv1 32) list_add_~new.offset) (= ~elem~0.offset (_ bv0 32)))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {2902#false} is VALID [2018-11-23 11:07:24,171 INFO L256 TraceCheckUtils]: 42: Hoare triple {2902#false} call __blast_assert(); {2902#false} is VALID [2018-11-23 11:07:24,171 INFO L273 TraceCheckUtils]: 43: Hoare triple {2902#false} assume !false; {2902#false} is VALID [2018-11-23 11:07:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:24,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:25,185 INFO L273 TraceCheckUtils]: 43: Hoare triple {2902#false} assume !false; {2902#false} is VALID [2018-11-23 11:07:25,186 INFO L256 TraceCheckUtils]: 42: Hoare triple {2902#false} call __blast_assert(); {2902#false} is VALID [2018-11-23 11:07:25,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {3053#(not (= ~elem~0.offset list_add_~new.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {2902#false} is VALID [2018-11-23 11:07:25,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {3057#(not (= ~elem~0.offset |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3053#(not (= ~elem~0.offset list_add_~new.offset))} is VALID [2018-11-23 11:07:25,187 INFO L256 TraceCheckUtils]: 39: Hoare triple {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {3057#(not (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:07:25,189 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} #79#return; {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} is VALID [2018-11-23 11:07:25,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} assume true; {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:25,192 INFO L273 TraceCheckUtils]: 36: Hoare triple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:25,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:25,194 INFO L273 TraceCheckUtils]: 34: Hoare triple {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:25,194 INFO L256 TraceCheckUtils]: 33: Hoare triple {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {3014#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:25,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} is VALID [2018-11-23 11:07:25,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} is VALID [2018-11-23 11:07:25,197 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2901#true} {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} #77#return; {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} is VALID [2018-11-23 11:07:25,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {2901#true} assume true; {2901#true} is VALID [2018-11-23 11:07:25,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {2901#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2901#true} is VALID [2018-11-23 11:07:25,198 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2901#true} {2901#true} #67#return; {2901#true} is VALID [2018-11-23 11:07:25,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {2901#true} assume true; {2901#true} is VALID [2018-11-23 11:07:25,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {2901#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {2901#true} is VALID [2018-11-23 11:07:25,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {2901#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {2901#true} is VALID [2018-11-23 11:07:25,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {2901#true} assume ~bvsgt32(~size, 0bv32); {2901#true} is VALID [2018-11-23 11:07:25,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {2901#true} ~size := #in~size; {2901#true} is VALID [2018-11-23 11:07:25,200 INFO L256 TraceCheckUtils]: 21: Hoare triple {2901#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {2901#true} is VALID [2018-11-23 11:07:25,200 INFO L273 TraceCheckUtils]: 20: Hoare triple {2901#true} ~size := #in~size; {2901#true} is VALID [2018-11-23 11:07:25,200 INFO L256 TraceCheckUtils]: 19: Hoare triple {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {2901#true} is VALID [2018-11-23 11:07:25,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {3125#(not (= |main_#t~ret32.offset| ~elem~0.offset))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {3061#(not (= ~elem~0.offset main_~dev1~0.offset))} is VALID [2018-11-23 11:07:25,227 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3133#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |my_malloc_#res.offset|)))} {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} #75#return; {3125#(not (= |main_#t~ret32.offset| ~elem~0.offset))} is VALID [2018-11-23 11:07:25,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {3133#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |my_malloc_#res.offset|)))} assume true; {3133#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |my_malloc_#res.offset|)))} is VALID [2018-11-23 11:07:25,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {3140#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |my_malloc_#t~ret30.offset|)))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3133#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |my_malloc_#res.offset|)))} is VALID [2018-11-23 11:07:25,243 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3148#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |__getMemory_#res.offset|)))} {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} #67#return; {3140#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |my_malloc_#t~ret30.offset|)))} is VALID [2018-11-23 11:07:25,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {3148#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |__getMemory_#res.offset|)))} assume true; {3148#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |__getMemory_#res.offset|)))} is VALID [2018-11-23 11:07:25,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {3155#(or (not (= ~elem~0.offset ~guard_malloc_counter~0.offset)) (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset))} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {3148#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= ~elem~0.offset |__getMemory_#res.offset|)))} is VALID [2018-11-23 11:07:25,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {3155#(or (not (= ~elem~0.offset ~guard_malloc_counter~0.offset)) (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset))} is VALID [2018-11-23 11:07:25,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} assume ~bvsgt32(~size, 0bv32); {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:25,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} ~size := #in~size; {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:25,296 INFO L256 TraceCheckUtils]: 8: Hoare triple {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:25,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} ~size := #in~size; {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:25,297 INFO L256 TraceCheckUtils]: 6: Hoare triple {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {3144#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) ~elem~0.offset) (not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:25,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:25,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} call #t~ret34 := main(); {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:25,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} {2901#true} #71#return; {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:25,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} assume true; {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:25,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {2901#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {3129#(not (= (bvadd ~elem~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:25,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {2901#true} call ULTIMATE.init(); {2901#true} is VALID [2018-11-23 11:07:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:25,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:25,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-11-23 11:07:25,314 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-11-23 11:07:25,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:25,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:07:25,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:25,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:07:25,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:07:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:07:25,577 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 24 states. [2018-11-23 11:07:28,498 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 11:07:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:32,488 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-11-23 11:07:32,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:07:32,489 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-11-23 11:07:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:07:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 89 transitions. [2018-11-23 11:07:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:07:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 89 transitions. [2018-11-23 11:07:32,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 89 transitions. [2018-11-23 11:07:32,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:32,798 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:07:32,799 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 11:07:32,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:07:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 11:07:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2018-11-23 11:07:32,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:32,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 86 states. [2018-11-23 11:07:32,978 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 86 states. [2018-11-23 11:07:32,978 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 86 states. [2018-11-23 11:07:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:32,984 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-11-23 11:07:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-11-23 11:07:32,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:32,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:32,985 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 96 states. [2018-11-23 11:07:32,985 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 96 states. [2018-11-23 11:07:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:32,989 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-11-23 11:07:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-11-23 11:07:32,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:32,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:32,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:32,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 11:07:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-11-23 11:07:32,994 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 44 [2018-11-23 11:07:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-11-23 11:07:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:07:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-11-23 11:07:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:07:32,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:32,996 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:32,996 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:32,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1585049735, now seen corresponding path program 1 times [2018-11-23 11:07:32,997 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:32,997 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:33,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:33,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:33,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {3671#true} call ULTIMATE.init(); {3671#true} is VALID [2018-11-23 11:07:33,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {3671#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {3671#true} is VALID [2018-11-23 11:07:33,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {3671#true} assume true; {3671#true} is VALID [2018-11-23 11:07:33,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3671#true} {3671#true} #71#return; {3671#true} is VALID [2018-11-23 11:07:33,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {3671#true} call #t~ret34 := main(); {3671#true} is VALID [2018-11-23 11:07:33,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {3671#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {3671#true} is VALID [2018-11-23 11:07:33,296 INFO L256 TraceCheckUtils]: 6: Hoare triple {3671#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {3671#true} is VALID [2018-11-23 11:07:33,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {3671#true} ~size := #in~size; {3671#true} is VALID [2018-11-23 11:07:33,296 INFO L256 TraceCheckUtils]: 8: Hoare triple {3671#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3671#true} is VALID [2018-11-23 11:07:33,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {3671#true} ~size := #in~size; {3671#true} is VALID [2018-11-23 11:07:33,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {3671#true} assume ~bvsgt32(~size, 0bv32); {3671#true} is VALID [2018-11-23 11:07:33,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {3671#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {3671#true} is VALID [2018-11-23 11:07:33,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {3671#true} assume 0bv32 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0bv32, 0bv32; {3712#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:07:33,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {3712#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} assume true; {3712#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:07:33,298 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3712#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} {3671#true} #67#return; {3719#(and (= |my_malloc_#t~ret30.offset| (_ bv0 32)) (= (_ bv0 32) |my_malloc_#t~ret30.base|))} is VALID [2018-11-23 11:07:33,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {3719#(and (= |my_malloc_#t~ret30.offset| (_ bv0 32)) (= (_ bv0 32) |my_malloc_#t~ret30.base|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3723#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} is VALID [2018-11-23 11:07:33,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {3723#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} assume true; {3723#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} is VALID [2018-11-23 11:07:33,300 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3723#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} {3671#true} #75#return; {3730#(and (= |main_#t~ret32.base| (_ bv0 32)) (= |main_#t~ret32.offset| (_ bv0 32)))} is VALID [2018-11-23 11:07:33,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {3730#(and (= |main_#t~ret32.base| (_ bv0 32)) (= |main_#t~ret32.offset| (_ bv0 32)))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} is VALID [2018-11-23 11:07:33,301 INFO L256 TraceCheckUtils]: 19: Hoare triple {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {3671#true} is VALID [2018-11-23 11:07:33,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {3671#true} ~size := #in~size; {3671#true} is VALID [2018-11-23 11:07:33,301 INFO L256 TraceCheckUtils]: 21: Hoare triple {3671#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3671#true} is VALID [2018-11-23 11:07:33,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {3671#true} ~size := #in~size; {3671#true} is VALID [2018-11-23 11:07:33,302 INFO L273 TraceCheckUtils]: 23: Hoare triple {3671#true} assume ~bvsgt32(~size, 0bv32); {3671#true} is VALID [2018-11-23 11:07:33,302 INFO L273 TraceCheckUtils]: 24: Hoare triple {3671#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {3671#true} is VALID [2018-11-23 11:07:33,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {3671#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {3671#true} is VALID [2018-11-23 11:07:33,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {3671#true} assume true; {3671#true} is VALID [2018-11-23 11:07:33,303 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3671#true} {3671#true} #67#return; {3671#true} is VALID [2018-11-23 11:07:33,303 INFO L273 TraceCheckUtils]: 28: Hoare triple {3671#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3671#true} is VALID [2018-11-23 11:07:33,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {3671#true} assume true; {3671#true} is VALID [2018-11-23 11:07:33,305 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3671#true} {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} #77#return; {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} is VALID [2018-11-23 11:07:33,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} is VALID [2018-11-23 11:07:33,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {3672#false} is VALID [2018-11-23 11:07:33,315 INFO L256 TraceCheckUtils]: 33: Hoare triple {3672#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {3672#false} is VALID [2018-11-23 11:07:33,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {3672#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3672#false} is VALID [2018-11-23 11:07:33,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {3672#false} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {3672#false} is VALID [2018-11-23 11:07:33,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {3672#false} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {3672#false} is VALID [2018-11-23 11:07:33,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {3672#false} assume true; {3672#false} is VALID [2018-11-23 11:07:33,316 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3672#false} {3672#false} #79#return; {3672#false} is VALID [2018-11-23 11:07:33,316 INFO L256 TraceCheckUtils]: 39: Hoare triple {3672#false} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {3672#false} is VALID [2018-11-23 11:07:33,316 INFO L273 TraceCheckUtils]: 40: Hoare triple {3672#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3672#false} is VALID [2018-11-23 11:07:33,316 INFO L273 TraceCheckUtils]: 41: Hoare triple {3672#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {3672#false} is VALID [2018-11-23 11:07:33,316 INFO L256 TraceCheckUtils]: 42: Hoare triple {3672#false} call __blast_assert(); {3672#false} is VALID [2018-11-23 11:07:33,316 INFO L273 TraceCheckUtils]: 43: Hoare triple {3672#false} assume !false; {3672#false} is VALID [2018-11-23 11:07:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:07:33,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:33,533 INFO L273 TraceCheckUtils]: 43: Hoare triple {3672#false} assume !false; {3672#false} is VALID [2018-11-23 11:07:33,534 INFO L256 TraceCheckUtils]: 42: Hoare triple {3672#false} call __blast_assert(); {3672#false} is VALID [2018-11-23 11:07:33,534 INFO L273 TraceCheckUtils]: 41: Hoare triple {3672#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {3672#false} is VALID [2018-11-23 11:07:33,535 INFO L273 TraceCheckUtils]: 40: Hoare triple {3672#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3672#false} is VALID [2018-11-23 11:07:33,535 INFO L256 TraceCheckUtils]: 39: Hoare triple {3672#false} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {3672#false} is VALID [2018-11-23 11:07:33,535 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3671#true} {3672#false} #79#return; {3672#false} is VALID [2018-11-23 11:07:33,535 INFO L273 TraceCheckUtils]: 37: Hoare triple {3671#true} assume true; {3671#true} is VALID [2018-11-23 11:07:33,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {3671#true} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {3671#true} is VALID [2018-11-23 11:07:33,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {3671#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {3671#true} is VALID [2018-11-23 11:07:33,536 INFO L273 TraceCheckUtils]: 34: Hoare triple {3671#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3671#true} is VALID [2018-11-23 11:07:33,536 INFO L256 TraceCheckUtils]: 33: Hoare triple {3672#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {3671#true} is VALID [2018-11-23 11:07:33,537 INFO L273 TraceCheckUtils]: 32: Hoare triple {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {3672#false} is VALID [2018-11-23 11:07:33,537 INFO L273 TraceCheckUtils]: 31: Hoare triple {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} is VALID [2018-11-23 11:07:33,538 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3671#true} {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} #77#return; {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} is VALID [2018-11-23 11:07:33,538 INFO L273 TraceCheckUtils]: 29: Hoare triple {3671#true} assume true; {3671#true} is VALID [2018-11-23 11:07:33,538 INFO L273 TraceCheckUtils]: 28: Hoare triple {3671#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3671#true} is VALID [2018-11-23 11:07:33,539 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3671#true} {3671#true} #67#return; {3671#true} is VALID [2018-11-23 11:07:33,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {3671#true} assume true; {3671#true} is VALID [2018-11-23 11:07:33,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {3671#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {3671#true} is VALID [2018-11-23 11:07:33,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {3671#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {3671#true} is VALID [2018-11-23 11:07:33,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {3671#true} assume ~bvsgt32(~size, 0bv32); {3671#true} is VALID [2018-11-23 11:07:33,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {3671#true} ~size := #in~size; {3671#true} is VALID [2018-11-23 11:07:33,540 INFO L256 TraceCheckUtils]: 21: Hoare triple {3671#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3671#true} is VALID [2018-11-23 11:07:33,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {3671#true} ~size := #in~size; {3671#true} is VALID [2018-11-23 11:07:33,540 INFO L256 TraceCheckUtils]: 19: Hoare triple {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {3671#true} is VALID [2018-11-23 11:07:33,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {3730#(and (= |main_#t~ret32.base| (_ bv0 32)) (= |main_#t~ret32.offset| (_ bv0 32)))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {3734#(and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base))} is VALID [2018-11-23 11:07:33,541 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3723#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} {3671#true} #75#return; {3730#(and (= |main_#t~ret32.base| (_ bv0 32)) (= |main_#t~ret32.offset| (_ bv0 32)))} is VALID [2018-11-23 11:07:33,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {3723#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} assume true; {3723#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} is VALID [2018-11-23 11:07:33,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {3719#(and (= |my_malloc_#t~ret30.offset| (_ bv0 32)) (= (_ bv0 32) |my_malloc_#t~ret30.base|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3723#(and (= (_ bv0 32) |my_malloc_#res.base|) (= (_ bv0 32) |my_malloc_#res.offset|))} is VALID [2018-11-23 11:07:33,544 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3712#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} {3671#true} #67#return; {3719#(and (= |my_malloc_#t~ret30.offset| (_ bv0 32)) (= (_ bv0 32) |my_malloc_#t~ret30.base|))} is VALID [2018-11-23 11:07:33,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {3712#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} assume true; {3712#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:07:33,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {3671#true} assume 0bv32 == #t~nondet29;havoc #t~nondet29;#res.base, #res.offset := 0bv32, 0bv32; {3712#(and (= (_ bv0 32) |__getMemory_#res.base|) (= |__getMemory_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:07:33,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {3671#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {3671#true} is VALID [2018-11-23 11:07:33,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {3671#true} assume ~bvsgt32(~size, 0bv32); {3671#true} is VALID [2018-11-23 11:07:33,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {3671#true} ~size := #in~size; {3671#true} is VALID [2018-11-23 11:07:33,546 INFO L256 TraceCheckUtils]: 8: Hoare triple {3671#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {3671#true} is VALID [2018-11-23 11:07:33,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {3671#true} ~size := #in~size; {3671#true} is VALID [2018-11-23 11:07:33,547 INFO L256 TraceCheckUtils]: 6: Hoare triple {3671#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {3671#true} is VALID [2018-11-23 11:07:33,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {3671#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {3671#true} is VALID [2018-11-23 11:07:33,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {3671#true} call #t~ret34 := main(); {3671#true} is VALID [2018-11-23 11:07:33,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3671#true} {3671#true} #71#return; {3671#true} is VALID [2018-11-23 11:07:33,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {3671#true} assume true; {3671#true} is VALID [2018-11-23 11:07:33,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {3671#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {3671#true} is VALID [2018-11-23 11:07:33,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {3671#true} call ULTIMATE.init(); {3671#true} is VALID [2018-11-23 11:07:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:07:33,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:33,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 11:07:33,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-11-23 11:07:33,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:33,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:07:33,625 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-23 11:07:33,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:07:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:07:33,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:07:33,626 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 7 states. [2018-11-23 11:07:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:34,726 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-23 11:07:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:07:34,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-11-23 11:07:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:07:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 11:07:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:07:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 11:07:34,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-23 11:07:34,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:34,872 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:07:34,873 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:07:34,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:07:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:07:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 11:07:35,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:35,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 11:07:35,184 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 11:07:35,185 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 11:07:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:35,188 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 11:07:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 11:07:35,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:35,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:35,189 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 11:07:35,189 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 11:07:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:35,192 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 11:07:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 11:07:35,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:35,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:35,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:35,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:07:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-23 11:07:35,195 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 44 [2018-11-23 11:07:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:35,195 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-23 11:07:35,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:07:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 11:07:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:07:35,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:35,197 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:35,197 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:35,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:35,197 INFO L82 PathProgramCache]: Analyzing trace with hash -470142089, now seen corresponding path program 1 times [2018-11-23 11:07:35,197 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:35,198 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:35,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:35,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:36,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {4284#true} call ULTIMATE.init(); {4284#true} is VALID [2018-11-23 11:07:36,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {4284#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} assume true; {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} {4284#true} #71#return; {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} call #t~ret34 := main(); {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,069 INFO L256 TraceCheckUtils]: 6: Hoare triple {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,070 INFO L256 TraceCheckUtils]: 8: Hoare triple {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:36,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {4324#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:36,097 INFO L273 TraceCheckUtils]: 12: Hoare triple {4324#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {4328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:36,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {4328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {4328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:36,099 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {4328#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} {4308#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {4335#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:36,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {4335#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {4339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:36,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {4339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {4339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:36,102 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {4339#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} {4292#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} #75#return; {4346#(= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:36,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {4346#(= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) (_ bv0 32))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:36,103 INFO L256 TraceCheckUtils]: 19: Hoare triple {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {4284#true} is VALID [2018-11-23 11:07:36,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {4284#true} ~size := #in~size; {4284#true} is VALID [2018-11-23 11:07:36,104 INFO L256 TraceCheckUtils]: 21: Hoare triple {4284#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {4284#true} is VALID [2018-11-23 11:07:36,104 INFO L273 TraceCheckUtils]: 22: Hoare triple {4284#true} ~size := #in~size; {4284#true} is VALID [2018-11-23 11:07:36,104 INFO L273 TraceCheckUtils]: 23: Hoare triple {4284#true} assume ~bvsgt32(~size, 0bv32); {4284#true} is VALID [2018-11-23 11:07:36,104 INFO L273 TraceCheckUtils]: 24: Hoare triple {4284#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {4284#true} is VALID [2018-11-23 11:07:36,105 INFO L273 TraceCheckUtils]: 25: Hoare triple {4284#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {4284#true} is VALID [2018-11-23 11:07:36,105 INFO L273 TraceCheckUtils]: 26: Hoare triple {4284#true} assume true; {4284#true} is VALID [2018-11-23 11:07:36,105 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4284#true} {4284#true} #67#return; {4284#true} is VALID [2018-11-23 11:07:36,105 INFO L273 TraceCheckUtils]: 28: Hoare triple {4284#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {4284#true} is VALID [2018-11-23 11:07:36,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {4284#true} assume true; {4284#true} is VALID [2018-11-23 11:07:36,115 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {4284#true} {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} #77#return; {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:36,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:36,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:36,116 INFO L256 TraceCheckUtils]: 33: Hoare triple {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {4284#true} is VALID [2018-11-23 11:07:36,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {4284#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4284#true} is VALID [2018-11-23 11:07:36,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {4284#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {4284#true} is VALID [2018-11-23 11:07:36,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {4284#true} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {4284#true} is VALID [2018-11-23 11:07:36,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {4284#true} assume true; {4284#true} is VALID [2018-11-23 11:07:36,117 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4284#true} {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} #79#return; {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:36,118 INFO L256 TraceCheckUtils]: 39: Hoare triple {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {4284#true} is VALID [2018-11-23 11:07:36,118 INFO L273 TraceCheckUtils]: 40: Hoare triple {4284#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4417#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:36,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {4417#(= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {4417#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:36,119 INFO L273 TraceCheckUtils]: 42: Hoare triple {4417#(= list_add_~new.offset |list_add_#in~new.offset|)} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {4424#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:36,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {4424#(= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {4424#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:36,120 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4424#(= ~elem~0.offset |list_add_#in~new.offset|)} {4350#(= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32))} #81#return; {4431#(= (_ bv1 32) ~elem~0.offset)} is VALID [2018-11-23 11:07:36,121 INFO L256 TraceCheckUtils]: 45: Hoare triple {4431#(= (_ bv1 32) ~elem~0.offset)} call list_del(~dev2~0.base, ~dev2~0.offset); {4435#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:36,122 INFO L273 TraceCheckUtils]: 46: Hoare triple {4435#(= |old(~elem~0.offset)| ~elem~0.offset)} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {4439#(and (= list_del_~entry.offset |list_del_#in~entry.offset|) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:07:36,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {4439#(and (= list_del_~entry.offset |list_del_#in~entry.offset|) (= |old(~elem~0.offset)| ~elem~0.offset))} assume ~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32; {4443#(and (= |old(~elem~0.offset)| |list_del_#in~entry.offset|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:36,124 INFO L273 TraceCheckUtils]: 48: Hoare triple {4443#(and (= |old(~elem~0.offset)| |list_del_#in~entry.offset|) (= ~elem~0.offset (_ bv0 32)))} assume true; {4443#(and (= |old(~elem~0.offset)| |list_del_#in~entry.offset|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:36,126 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4443#(and (= |old(~elem~0.offset)| |list_del_#in~entry.offset|) (= ~elem~0.offset (_ bv0 32)))} {4431#(= (_ bv1 32) ~elem~0.offset)} #83#return; {4450#(and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:36,127 INFO L256 TraceCheckUtils]: 50: Hoare triple {4450#(and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) (_ bv0 32)))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {4454#(and (= (_ bv1 32) |list_add_#in~new.offset|) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:36,128 INFO L273 TraceCheckUtils]: 51: Hoare triple {4454#(and (= (_ bv1 32) |list_add_#in~new.offset|) (= ~elem~0.offset (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4458#(and (= (_ bv1 32) list_add_~new.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:36,129 INFO L273 TraceCheckUtils]: 52: Hoare triple {4458#(and (= (_ bv1 32) list_add_~new.offset) (= ~elem~0.offset (_ bv0 32)))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {4285#false} is VALID [2018-11-23 11:07:36,129 INFO L256 TraceCheckUtils]: 53: Hoare triple {4285#false} call __blast_assert(); {4285#false} is VALID [2018-11-23 11:07:36,129 INFO L273 TraceCheckUtils]: 54: Hoare triple {4285#false} assume !false; {4285#false} is VALID [2018-11-23 11:07:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:07:36,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:37,400 INFO L273 TraceCheckUtils]: 54: Hoare triple {4285#false} assume !false; {4285#false} is VALID [2018-11-23 11:07:37,400 INFO L256 TraceCheckUtils]: 53: Hoare triple {4285#false} call __blast_assert(); {4285#false} is VALID [2018-11-23 11:07:37,401 INFO L273 TraceCheckUtils]: 52: Hoare triple {4474#(not (= ~elem~0.offset list_add_~new.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {4285#false} is VALID [2018-11-23 11:07:37,402 INFO L273 TraceCheckUtils]: 51: Hoare triple {4478#(not (= ~elem~0.offset |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4474#(not (= ~elem~0.offset list_add_~new.offset))} is VALID [2018-11-23 11:07:37,403 INFO L256 TraceCheckUtils]: 50: Hoare triple {4482#(not (= ~elem~0.offset main_~dev2~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {4478#(not (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:07:37,405 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4490#(or (not (= ~elem~0.offset |list_del_#in~entry.offset|)) (= |old(~elem~0.offset)| (_ bv0 32)))} {4486#(not (= ~elem~0.offset (_ bv0 32)))} #83#return; {4482#(not (= ~elem~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:07:37,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {4490#(or (not (= ~elem~0.offset |list_del_#in~entry.offset|)) (= |old(~elem~0.offset)| (_ bv0 32)))} assume true; {4490#(or (not (= ~elem~0.offset |list_del_#in~entry.offset|)) (= |old(~elem~0.offset)| (_ bv0 32)))} is VALID [2018-11-23 11:07:37,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {4497#(or (not (= |list_del_#in~entry.offset| (_ bv0 32))) (not (= ~elem~0.offset list_del_~entry.offset)) (= |old(~elem~0.offset)| (_ bv0 32)))} assume ~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32; {4490#(or (not (= ~elem~0.offset |list_del_#in~entry.offset|)) (= |old(~elem~0.offset)| (_ bv0 32)))} is VALID [2018-11-23 11:07:37,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {4501#(or (not (= |list_del_#in~entry.offset| (_ bv0 32))) (not (= ~elem~0.offset |list_del_#in~entry.offset|)) (= |old(~elem~0.offset)| (_ bv0 32)))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {4497#(or (not (= |list_del_#in~entry.offset| (_ bv0 32))) (not (= ~elem~0.offset list_del_~entry.offset)) (= |old(~elem~0.offset)| (_ bv0 32)))} is VALID [2018-11-23 11:07:37,409 INFO L256 TraceCheckUtils]: 45: Hoare triple {4486#(not (= ~elem~0.offset (_ bv0 32)))} call list_del(~dev2~0.base, ~dev2~0.offset); {4501#(or (not (= |list_del_#in~entry.offset| (_ bv0 32))) (not (= ~elem~0.offset |list_del_#in~entry.offset|)) (= |old(~elem~0.offset)| (_ bv0 32)))} is VALID [2018-11-23 11:07:37,411 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4509#(or (= (_ bv0 32) |list_add_#in~new.offset|) (not (= ~elem~0.offset (_ bv0 32))))} {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} #81#return; {4486#(not (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:37,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {4509#(or (= (_ bv0 32) |list_add_#in~new.offset|) (not (= ~elem~0.offset (_ bv0 32))))} assume true; {4509#(or (= (_ bv0 32) |list_add_#in~new.offset|) (not (= ~elem~0.offset (_ bv0 32))))} is VALID [2018-11-23 11:07:37,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {4516#(or (= (_ bv0 32) |list_add_#in~new.offset|) (not (= (_ bv0 32) list_add_~new.offset)))} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {4509#(or (= (_ bv0 32) |list_add_#in~new.offset|) (not (= ~elem~0.offset (_ bv0 32))))} is VALID [2018-11-23 11:07:37,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {4516#(or (= (_ bv0 32) |list_add_#in~new.offset|) (not (= (_ bv0 32) list_add_~new.offset)))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {4516#(or (= (_ bv0 32) |list_add_#in~new.offset|) (not (= (_ bv0 32) list_add_~new.offset)))} is VALID [2018-11-23 11:07:37,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {4284#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4516#(or (= (_ bv0 32) |list_add_#in~new.offset|) (not (= (_ bv0 32) list_add_~new.offset)))} is VALID [2018-11-23 11:07:37,414 INFO L256 TraceCheckUtils]: 39: Hoare triple {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {4284#true} is VALID [2018-11-23 11:07:37,429 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4284#true} {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} #79#return; {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:37,429 INFO L273 TraceCheckUtils]: 37: Hoare triple {4284#true} assume true; {4284#true} is VALID [2018-11-23 11:07:37,429 INFO L273 TraceCheckUtils]: 36: Hoare triple {4284#true} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {4284#true} is VALID [2018-11-23 11:07:37,429 INFO L273 TraceCheckUtils]: 35: Hoare triple {4284#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {4284#true} is VALID [2018-11-23 11:07:37,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {4284#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4284#true} is VALID [2018-11-23 11:07:37,430 INFO L256 TraceCheckUtils]: 33: Hoare triple {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {4284#true} is VALID [2018-11-23 11:07:37,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:37,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:37,431 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {4284#true} {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} #77#return; {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:37,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {4284#true} assume true; {4284#true} is VALID [2018-11-23 11:07:37,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {4284#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {4284#true} is VALID [2018-11-23 11:07:37,432 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4284#true} {4284#true} #67#return; {4284#true} is VALID [2018-11-23 11:07:37,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {4284#true} assume true; {4284#true} is VALID [2018-11-23 11:07:37,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {4284#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {4284#true} is VALID [2018-11-23 11:07:37,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {4284#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {4284#true} is VALID [2018-11-23 11:07:37,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {4284#true} assume ~bvsgt32(~size, 0bv32); {4284#true} is VALID [2018-11-23 11:07:37,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {4284#true} ~size := #in~size; {4284#true} is VALID [2018-11-23 11:07:37,432 INFO L256 TraceCheckUtils]: 21: Hoare triple {4284#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {4284#true} is VALID [2018-11-23 11:07:37,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {4284#true} ~size := #in~size; {4284#true} is VALID [2018-11-23 11:07:37,433 INFO L256 TraceCheckUtils]: 19: Hoare triple {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {4284#true} is VALID [2018-11-23 11:07:37,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {4586#(not (= |main_#t~ret32.offset| (_ bv0 32)))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {4505#(not (= main_~dev1~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:07:37,434 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {4594#(or (not (= (_ bv0 32) |my_malloc_#res.offset|)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} #75#return; {4586#(not (= |main_#t~ret32.offset| (_ bv0 32)))} is VALID [2018-11-23 11:07:37,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {4594#(or (not (= (_ bv0 32) |my_malloc_#res.offset|)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} assume true; {4594#(or (not (= (_ bv0 32) |my_malloc_#res.offset|)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:37,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {4601#(or (not (= |my_malloc_#t~ret30.offset| (_ bv0 32))) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {4594#(or (not (= (_ bv0 32) |my_malloc_#res.offset|)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:37,436 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {4609#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) (_ bv0 32)) (not (= |__getMemory_#res.offset| (_ bv0 32))))} {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} #67#return; {4601#(or (not (= |my_malloc_#t~ret30.offset| (_ bv0 32))) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:37,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {4609#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) (_ bv0 32)) (not (= |__getMemory_#res.offset| (_ bv0 32))))} assume true; {4609#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) (_ bv0 32)) (not (= |__getMemory_#res.offset| (_ bv0 32))))} is VALID [2018-11-23 11:07:37,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {4616#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) (_ bv0 32)) (not (= (_ bv0 32) ~guard_malloc_counter~0.offset)))} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {4609#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) (_ bv0 32)) (not (= |__getMemory_#res.offset| (_ bv0 32))))} is VALID [2018-11-23 11:07:37,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {4616#(or (= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) (_ bv0 32)) (not (= (_ bv0 32) ~guard_malloc_counter~0.offset)))} is VALID [2018-11-23 11:07:37,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} assume ~bvsgt32(~size, 0bv32); {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:37,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} ~size := #in~size; {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:37,441 INFO L256 TraceCheckUtils]: 8: Hoare triple {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:37,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} ~size := #in~size; {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:37,442 INFO L256 TraceCheckUtils]: 6: Hoare triple {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {4605#(or (not (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset)) (= (_ bv4294967295 32) |old(~guard_malloc_counter~0.offset)|))} is VALID [2018-11-23 11:07:37,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:37,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} call #t~ret34 := main(); {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:37,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} {4284#true} #71#return; {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:37,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} assume true; {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:37,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {4284#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {4590#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:37,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {4284#true} call ULTIMATE.init(); {4284#true} is VALID [2018-11-23 11:07:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:07:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:37,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-11-23 11:07:37,453 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 55 [2018-11-23 11:07:37,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:37,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:07:38,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:38,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:07:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:07:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:07:38,094 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 36 states. [2018-11-23 11:07:40,954 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 11:07:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:51,436 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-23 11:07:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:07:51,436 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 55 [2018-11-23 11:07:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:07:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2018-11-23 11:07:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:07:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2018-11-23 11:07:51,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 76 transitions. [2018-11-23 11:07:51,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:51,607 INFO L225 Difference]: With dead ends: 81 [2018-11-23 11:07:51,607 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 11:07:51,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=397, Invalid=3635, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 11:07:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 11:07:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-11-23 11:07:51,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:51,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 69 states. [2018-11-23 11:07:51,736 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 69 states. [2018-11-23 11:07:51,737 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 69 states. [2018-11-23 11:07:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:51,740 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-23 11:07:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 11:07:51,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:51,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:51,741 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 75 states. [2018-11-23 11:07:51,741 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 75 states. [2018-11-23 11:07:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:51,743 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-23 11:07:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 11:07:51,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:51,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:51,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:51,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:07:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-11-23 11:07:51,747 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2018-11-23 11:07:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:51,747 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-11-23 11:07:51,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:07:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-11-23 11:07:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:07:51,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:51,748 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:51,749 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:51,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:51,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1279488715, now seen corresponding path program 1 times [2018-11-23 11:07:51,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:51,749 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:51,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:51,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:52,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2018-11-23 11:07:52,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {5068#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} assume true; {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} {5068#true} #71#return; {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,556 INFO L256 TraceCheckUtils]: 4: Hoare triple {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} call #t~ret34 := main(); {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,557 INFO L256 TraceCheckUtils]: 6: Hoare triple {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,557 INFO L256 TraceCheckUtils]: 8: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {5108#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:52,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {5108#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {5112#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {5112#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {5112#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,584 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {5112#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {5119#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {5119#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {5123#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {5123#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {5123#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,586 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {5123#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} {5076#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} #75#return; {5130#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {5130#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {5134#(and (= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:52,588 INFO L256 TraceCheckUtils]: 19: Hoare triple {5134#(and (= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,589 INFO L256 TraceCheckUtils]: 21: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:52,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {5108#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:52,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {5108#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {5112#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {5112#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {5112#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,635 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5112#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {5119#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {5119#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {5123#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {5123#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {5123#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:52,637 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {5123#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} {5134#(and (= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))} #77#return; {5171#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv1 32)) |main_#t~ret33.offset|))} is VALID [2018-11-23 11:07:52,638 INFO L273 TraceCheckUtils]: 31: Hoare triple {5171#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv1 32)) |main_#t~ret33.offset|))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {5175#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))} is VALID [2018-11-23 11:07:52,639 INFO L273 TraceCheckUtils]: 32: Hoare triple {5175#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {5175#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))} is VALID [2018-11-23 11:07:52,639 INFO L256 TraceCheckUtils]: 33: Hoare triple {5175#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {5068#true} is VALID [2018-11-23 11:07:52,639 INFO L273 TraceCheckUtils]: 34: Hoare triple {5068#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:52,640 INFO L273 TraceCheckUtils]: 35: Hoare triple {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:52,641 INFO L273 TraceCheckUtils]: 36: Hoare triple {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:52,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:52,643 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} {5175#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))} #79#return; {5199#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset main_~dev2~0.offset) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))} is VALID [2018-11-23 11:07:52,643 INFO L256 TraceCheckUtils]: 39: Hoare triple {5199#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset main_~dev2~0.offset) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {5068#true} is VALID [2018-11-23 11:07:52,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {5068#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:52,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:52,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:52,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:52,647 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} {5199#(and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= ~elem~0.offset main_~dev2~0.offset) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))} #81#return; {5218#(and (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} is VALID [2018-11-23 11:07:52,648 INFO L256 TraceCheckUtils]: 45: Hoare triple {5218#(and (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} call list_del(~dev2~0.base, ~dev2~0.offset); {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:52,648 INFO L273 TraceCheckUtils]: 46: Hoare triple {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:52,649 INFO L273 TraceCheckUtils]: 47: Hoare triple {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} assume !(~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset); {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:52,649 INFO L273 TraceCheckUtils]: 48: Hoare triple {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} assume true; {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:52,651 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} {5218#(and (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} #83#return; {5218#(and (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} is VALID [2018-11-23 11:07:52,652 INFO L256 TraceCheckUtils]: 50: Hoare triple {5218#(and (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {5238#(and (= (bvadd |list_add_#in~new.offset| (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} is VALID [2018-11-23 11:07:52,653 INFO L273 TraceCheckUtils]: 51: Hoare triple {5238#(and (= (bvadd |list_add_#in~new.offset| (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5242#(and (= (bvadd list_add_~new.offset (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} is VALID [2018-11-23 11:07:52,654 INFO L273 TraceCheckUtils]: 52: Hoare triple {5242#(and (= (bvadd list_add_~new.offset (_ bv4294967295 32)) ~elem~0.offset) (= (_ bv1 32) ~elem~0.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {5069#false} is VALID [2018-11-23 11:07:52,654 INFO L256 TraceCheckUtils]: 53: Hoare triple {5069#false} call __blast_assert(); {5069#false} is VALID [2018-11-23 11:07:52,654 INFO L273 TraceCheckUtils]: 54: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2018-11-23 11:07:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:07:52,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:54,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2018-11-23 11:07:54,127 INFO L256 TraceCheckUtils]: 53: Hoare triple {5069#false} call __blast_assert(); {5069#false} is VALID [2018-11-23 11:07:54,128 INFO L273 TraceCheckUtils]: 52: Hoare triple {5258#(not (= ~elem~0.offset list_add_~new.offset))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {5069#false} is VALID [2018-11-23 11:07:54,128 INFO L273 TraceCheckUtils]: 51: Hoare triple {5262#(not (= ~elem~0.offset |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5258#(not (= ~elem~0.offset list_add_~new.offset))} is VALID [2018-11-23 11:07:54,129 INFO L256 TraceCheckUtils]: 50: Hoare triple {5266#(not (= ~elem~0.offset main_~dev2~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {5262#(not (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:07:54,130 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} {5266#(not (= ~elem~0.offset main_~dev2~0.offset))} #83#return; {5266#(not (= ~elem~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:07:54,130 INFO L273 TraceCheckUtils]: 48: Hoare triple {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} assume true; {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:54,130 INFO L273 TraceCheckUtils]: 47: Hoare triple {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} assume !(~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset); {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:54,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:54,132 INFO L256 TraceCheckUtils]: 45: Hoare triple {5266#(not (= ~elem~0.offset main_~dev2~0.offset))} call list_del(~dev2~0.base, ~dev2~0.offset); {5222#(= |old(~elem~0.offset)| ~elem~0.offset)} is VALID [2018-11-23 11:07:54,133 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} {5285#(not (= main_~dev1~0.offset main_~dev2~0.offset))} #81#return; {5266#(not (= ~elem~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:07:54,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} assume true; {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:54,135 INFO L273 TraceCheckUtils]: 42: Hoare triple {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {5192#(= ~elem~0.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:54,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:54,136 INFO L273 TraceCheckUtils]: 40: Hoare triple {5068#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5185#(= list_add_~new.offset |list_add_#in~new.offset|)} is VALID [2018-11-23 11:07:54,136 INFO L256 TraceCheckUtils]: 39: Hoare triple {5285#(not (= main_~dev1~0.offset main_~dev2~0.offset))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {5068#true} is VALID [2018-11-23 11:07:54,137 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {5068#true} {5285#(not (= main_~dev1~0.offset main_~dev2~0.offset))} #79#return; {5285#(not (= main_~dev1~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:07:54,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {5068#true} assume true; {5068#true} is VALID [2018-11-23 11:07:54,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {5068#true} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {5068#true} is VALID [2018-11-23 11:07:54,138 INFO L273 TraceCheckUtils]: 35: Hoare triple {5068#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {5068#true} is VALID [2018-11-23 11:07:54,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {5068#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5068#true} is VALID [2018-11-23 11:07:54,138 INFO L256 TraceCheckUtils]: 33: Hoare triple {5285#(not (= main_~dev1~0.offset main_~dev2~0.offset))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {5068#true} is VALID [2018-11-23 11:07:54,139 INFO L273 TraceCheckUtils]: 32: Hoare triple {5285#(not (= main_~dev1~0.offset main_~dev2~0.offset))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {5285#(not (= main_~dev1~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:07:54,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {5325#(not (= main_~dev1~0.offset |main_#t~ret33.offset|))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {5285#(not (= main_~dev1~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:07:54,140 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {5333#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} {5329#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} #77#return; {5325#(not (= main_~dev1~0.offset |main_#t~ret33.offset|))} is VALID [2018-11-23 11:07:54,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {5333#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume true; {5333#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:54,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {5340#(= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) |my_malloc_#t~ret30.offset|)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {5333#(= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:54,167 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5347#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {5340#(= (bvadd |old(~guard_malloc_counter~0.offset)| (_ bv1 32)) |my_malloc_#t~ret30.offset|)} is VALID [2018-11-23 11:07:54,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {5347#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume true; {5347#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:54,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {5108#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {5347#(= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:54,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {5108#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:07:54,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:54,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:54,192 INFO L256 TraceCheckUtils]: 21: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:54,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:54,192 INFO L256 TraceCheckUtils]: 19: Hoare triple {5329#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {5092#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:07:54,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {5369#(not (= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {5329#(not (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:54,194 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {5376#(not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} {5068#true} #75#return; {5369#(not (= (bvadd |main_#t~ret32.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:54,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {5376#(not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} assume true; {5376#(not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:54,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {5383#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) |my_malloc_#t~ret30.offset|))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {5376#(not (= (bvadd |my_malloc_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:54,225 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {5390#(not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} {5068#true} #67#return; {5383#(not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) |my_malloc_#t~ret30.offset|))} is VALID [2018-11-23 11:07:54,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {5390#(not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} assume true; {5390#(not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:54,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {5068#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {5390#(not (= (bvadd |__getMemory_#res.offset| (_ bv4294967295 32)) ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:07:54,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {5068#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {5068#true} is VALID [2018-11-23 11:07:54,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {5068#true} assume ~bvsgt32(~size, 0bv32); {5068#true} is VALID [2018-11-23 11:07:54,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {5068#true} ~size := #in~size; {5068#true} is VALID [2018-11-23 11:07:54,227 INFO L256 TraceCheckUtils]: 8: Hoare triple {5068#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {5068#true} is VALID [2018-11-23 11:07:54,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {5068#true} ~size := #in~size; {5068#true} is VALID [2018-11-23 11:07:54,227 INFO L256 TraceCheckUtils]: 6: Hoare triple {5068#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {5068#true} is VALID [2018-11-23 11:07:54,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {5068#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {5068#true} is VALID [2018-11-23 11:07:54,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret34 := main(); {5068#true} is VALID [2018-11-23 11:07:54,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #71#return; {5068#true} is VALID [2018-11-23 11:07:54,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2018-11-23 11:07:54,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {5068#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {5068#true} is VALID [2018-11-23 11:07:54,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2018-11-23 11:07:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:07:54,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:54,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 32 [2018-11-23 11:07:54,239 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-11-23 11:07:54,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:54,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:07:54,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:54,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:07:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:07:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:07:54,429 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 32 states. [2018-11-23 11:08:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:02,485 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 11:08:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:08:02,485 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-11-23 11:08:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:08:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2018-11-23 11:08:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:08:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2018-11-23 11:08:02,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 70 transitions. [2018-11-23 11:08:03,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:03,215 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:08:03,216 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:08:03,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=229, Invalid=2527, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:08:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:08:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-11-23 11:08:03,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:03,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 56 states. [2018-11-23 11:08:03,320 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 56 states. [2018-11-23 11:08:03,320 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 56 states. [2018-11-23 11:08:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:03,324 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 11:08:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 11:08:03,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:03,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:03,324 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 61 states. [2018-11-23 11:08:03,325 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 61 states. [2018-11-23 11:08:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:03,327 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 11:08:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 11:08:03,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:03,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:03,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:03,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:08:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-23 11:08:03,330 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 55 [2018-11-23 11:08:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:03,330 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-23 11:08:03,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:08:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 11:08:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:08:03,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:03,331 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:03,332 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:03,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1056948103, now seen corresponding path program 1 times [2018-11-23 11:08:03,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:03,332 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-23 11:08:03,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:08:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:03,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:03,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {5785#true} call ULTIMATE.init(); {5785#true} is VALID [2018-11-23 11:08:03,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {5785#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} assume true; {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} {5785#true} #71#return; {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} call #t~ret34 := main(); {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,741 INFO L256 TraceCheckUtils]: 6: Hoare triple {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,743 INFO L256 TraceCheckUtils]: 8: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:08:03,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:08:03,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume true; {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:08:03,768 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:08:03,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:08:03,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume true; {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:08:03,770 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} {5793#(= (_ bv0 32) ~guard_malloc_counter~0.offset)} #75#return; {5844#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:03,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32))} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {5844#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:03,770 INFO L256 TraceCheckUtils]: 19: Hoare triple {5844#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32))} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,772 INFO L256 TraceCheckUtils]: 21: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} ~size := #in~size; {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} assume ~bvsgt32(~size, 0bv32); {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} is VALID [2018-11-23 11:08:03,794 INFO L273 TraceCheckUtils]: 24: Hoare triple {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} is VALID [2018-11-23 11:08:03,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {5825#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|)} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {5869#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:08:03,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {5869#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {5869#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:08:03,796 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5869#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset))} {5809#(= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)} #67#return; {5876#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:08:03,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {5876#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset))} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {5880#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:08:03,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {5880#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} assume true; {5880#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} is VALID [2018-11-23 11:08:03,799 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {5880#(and (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) |old(~guard_malloc_counter~0.offset)|) (= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset))} {5844#(= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32))} #77#return; {5887#(= (bvadd |main_#t~ret33.offset| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:03,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {5887#(= (bvadd |main_#t~ret33.offset| (_ bv4294967294 32)) (_ bv0 32))} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:03,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:03,800 INFO L256 TraceCheckUtils]: 33: Hoare triple {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {5785#true} is VALID [2018-11-23 11:08:03,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {5785#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5785#true} is VALID [2018-11-23 11:08:03,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {5785#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {5785#true} is VALID [2018-11-23 11:08:03,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {5785#true} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {5785#true} is VALID [2018-11-23 11:08:03,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {5785#true} assume true; {5785#true} is VALID [2018-11-23 11:08:03,802 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {5785#true} {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} #79#return; {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:03,802 INFO L256 TraceCheckUtils]: 39: Hoare triple {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {5785#true} is VALID [2018-11-23 11:08:03,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {5785#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5785#true} is VALID [2018-11-23 11:08:03,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {5785#true} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {5785#true} is VALID [2018-11-23 11:08:03,803 INFO L273 TraceCheckUtils]: 42: Hoare triple {5785#true} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {5785#true} is VALID [2018-11-23 11:08:03,803 INFO L273 TraceCheckUtils]: 43: Hoare triple {5785#true} assume true; {5785#true} is VALID [2018-11-23 11:08:03,803 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {5785#true} {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} #81#return; {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:03,803 INFO L256 TraceCheckUtils]: 45: Hoare triple {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} call list_del(~dev2~0.base, ~dev2~0.offset); {5785#true} is VALID [2018-11-23 11:08:03,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {5785#true} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {5785#true} is VALID [2018-11-23 11:08:03,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {5785#true} assume ~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32; {5940#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:08:03,805 INFO L273 TraceCheckUtils]: 48: Hoare triple {5940#(= ~elem~0.offset (_ bv0 32))} assume true; {5940#(= ~elem~0.offset (_ bv0 32))} is VALID [2018-11-23 11:08:03,806 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5940#(= ~elem~0.offset (_ bv0 32))} {5891#(= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))} #83#return; {5947#(and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:08:03,807 INFO L256 TraceCheckUtils]: 50: Hoare triple {5947#(and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)))} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {5951#(and (= ~elem~0.offset (_ bv0 32)) (= (_ bv2 32) |list_add_#in~new.offset|))} is VALID [2018-11-23 11:08:03,808 INFO L273 TraceCheckUtils]: 51: Hoare triple {5951#(and (= ~elem~0.offset (_ bv0 32)) (= (_ bv2 32) |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5955#(and (= (_ bv2 32) list_add_~new.offset) (= ~elem~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:03,808 INFO L273 TraceCheckUtils]: 52: Hoare triple {5955#(and (= (_ bv2 32) list_add_~new.offset) (= ~elem~0.offset (_ bv0 32)))} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {5786#false} is VALID [2018-11-23 11:08:03,809 INFO L256 TraceCheckUtils]: 53: Hoare triple {5786#false} call __blast_assert(); {5786#false} is VALID [2018-11-23 11:08:03,809 INFO L273 TraceCheckUtils]: 54: Hoare triple {5786#false} assume !false; {5786#false} is VALID [2018-11-23 11:08:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:08:03,813 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:08:03,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:08:03,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 11:08:03,816 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-23 11:08:03,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:03,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:08:03,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:03,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:08:03,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:08:03,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:08:03,901 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 15 states. [2018-11-23 11:08:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:05,619 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 11:08:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:08:05,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-23 11:08:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:08:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 61 transitions. [2018-11-23 11:08:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:08:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 61 transitions. [2018-11-23 11:08:05,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 61 transitions. [2018-11-23 11:08:05,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:05,718 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:08:05,719 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:08:05,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:08:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:08:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 11:08:06,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:06,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 11:08:06,193 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:08:06,193 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:08:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:06,195 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 11:08:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 11:08:06,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:06,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:06,196 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:08:06,196 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:08:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:06,197 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 11:08:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 11:08:06,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:06,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:06,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:06,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:08:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-23 11:08:06,199 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 55 [2018-11-23 11:08:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:06,199 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-23 11:08:06,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:08:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 11:08:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:08:06,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:06,200 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:06,200 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:06,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1866294729, now seen corresponding path program 1 times [2018-11-23 11:08:06,201 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:06,201 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-23 11:08:06,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:08:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:06,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:06,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {6275#true} call ULTIMATE.init(); {6275#true} is VALID [2018-11-23 11:08:06,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {6275#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {6275#true} is VALID [2018-11-23 11:08:06,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:06,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6275#true} {6275#true} #71#return; {6275#true} is VALID [2018-11-23 11:08:06,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {6275#true} call #t~ret34 := main(); {6275#true} is VALID [2018-11-23 11:08:06,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {6275#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {6275#true} is VALID [2018-11-23 11:08:06,648 INFO L256 TraceCheckUtils]: 6: Hoare triple {6275#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {6275#true} is VALID [2018-11-23 11:08:06,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {6275#true} ~size := #in~size; {6275#true} is VALID [2018-11-23 11:08:06,648 INFO L256 TraceCheckUtils]: 8: Hoare triple {6275#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {6275#true} is VALID [2018-11-23 11:08:06,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {6275#true} ~size := #in~size; {6275#true} is VALID [2018-11-23 11:08:06,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {6275#true} assume ~bvsgt32(~size, 0bv32); {6275#true} is VALID [2018-11-23 11:08:06,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {6275#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {6275#true} is VALID [2018-11-23 11:08:06,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {6275#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {6275#true} is VALID [2018-11-23 11:08:06,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:06,649 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {6275#true} {6275#true} #67#return; {6275#true} is VALID [2018-11-23 11:08:06,649 INFO L273 TraceCheckUtils]: 15: Hoare triple {6275#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {6275#true} is VALID [2018-11-23 11:08:06,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:06,649 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {6275#true} {6275#true} #75#return; {6275#true} is VALID [2018-11-23 11:08:06,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {6275#true} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {6275#true} is VALID [2018-11-23 11:08:06,650 INFO L256 TraceCheckUtils]: 19: Hoare triple {6275#true} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {6275#true} is VALID [2018-11-23 11:08:06,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {6275#true} ~size := #in~size; {6275#true} is VALID [2018-11-23 11:08:06,650 INFO L256 TraceCheckUtils]: 21: Hoare triple {6275#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {6275#true} is VALID [2018-11-23 11:08:06,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {6275#true} ~size := #in~size; {6275#true} is VALID [2018-11-23 11:08:06,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {6275#true} assume ~bvsgt32(~size, 0bv32); {6275#true} is VALID [2018-11-23 11:08:06,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {6275#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {6275#true} is VALID [2018-11-23 11:08:06,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {6275#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {6275#true} is VALID [2018-11-23 11:08:06,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:06,651 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {6275#true} {6275#true} #67#return; {6275#true} is VALID [2018-11-23 11:08:06,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {6275#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {6275#true} is VALID [2018-11-23 11:08:06,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:06,651 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {6275#true} {6275#true} #77#return; {6275#true} is VALID [2018-11-23 11:08:06,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {6275#true} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {6275#true} is VALID [2018-11-23 11:08:06,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {6275#true} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {6275#true} is VALID [2018-11-23 11:08:06,652 INFO L256 TraceCheckUtils]: 33: Hoare triple {6275#true} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {6275#true} is VALID [2018-11-23 11:08:06,652 INFO L273 TraceCheckUtils]: 34: Hoare triple {6275#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {6382#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 11:08:06,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {6382#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {6382#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 11:08:06,653 INFO L273 TraceCheckUtils]: 36: Hoare triple {6382#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {6389#(and (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:08:06,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {6389#(and (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))} assume true; {6389#(and (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:08:06,654 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {6389#(and (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))} {6275#true} #79#return; {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:08:06,655 INFO L256 TraceCheckUtils]: 39: Hoare triple {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:06,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:06,656 INFO L273 TraceCheckUtils]: 41: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:06,657 INFO L273 TraceCheckUtils]: 42: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:06,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} assume true; {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:06,659 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} #81#return; {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:08:06,660 INFO L256 TraceCheckUtils]: 45: Hoare triple {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} call list_del(~dev2~0.base, ~dev2~0.offset); {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:06,678 INFO L273 TraceCheckUtils]: 46: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {6422#(and (= list_del_~entry.offset |list_del_#in~entry.offset|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (= list_del_~entry.base |list_del_#in~entry.base|))} is VALID [2018-11-23 11:08:06,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {6422#(and (= list_del_~entry.offset |list_del_#in~entry.offset|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (= list_del_~entry.base |list_del_#in~entry.base|))} assume !(~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset); {6426#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (or (not (= ~elem~0.base |list_del_#in~entry.base|)) (not (= ~elem~0.offset |list_del_#in~entry.offset|))))} is VALID [2018-11-23 11:08:06,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {6426#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (or (not (= ~elem~0.base |list_del_#in~entry.base|)) (not (= ~elem~0.offset |list_del_#in~entry.offset|))))} assume true; {6426#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (or (not (= ~elem~0.base |list_del_#in~entry.base|)) (not (= ~elem~0.offset |list_del_#in~entry.offset|))))} is VALID [2018-11-23 11:08:06,703 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {6426#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (or (not (= ~elem~0.base |list_del_#in~entry.base|)) (not (= ~elem~0.offset |list_del_#in~entry.offset|))))} {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} #83#return; {6276#false} is VALID [2018-11-23 11:08:06,704 INFO L256 TraceCheckUtils]: 50: Hoare triple {6276#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {6276#false} is VALID [2018-11-23 11:08:06,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {6276#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {6276#false} is VALID [2018-11-23 11:08:06,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {6276#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {6276#false} is VALID [2018-11-23 11:08:06,704 INFO L256 TraceCheckUtils]: 53: Hoare triple {6276#false} call __blast_assert(); {6276#false} is VALID [2018-11-23 11:08:06,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {6276#false} assume !false; {6276#false} is VALID [2018-11-23 11:08:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:08:06,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:07,221 INFO L273 TraceCheckUtils]: 54: Hoare triple {6276#false} assume !false; {6276#false} is VALID [2018-11-23 11:08:07,221 INFO L256 TraceCheckUtils]: 53: Hoare triple {6276#false} call __blast_assert(); {6276#false} is VALID [2018-11-23 11:08:07,221 INFO L273 TraceCheckUtils]: 52: Hoare triple {6276#false} assume !(~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset); {6276#false} is VALID [2018-11-23 11:08:07,222 INFO L273 TraceCheckUtils]: 51: Hoare triple {6276#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {6276#false} is VALID [2018-11-23 11:08:07,222 INFO L256 TraceCheckUtils]: 50: Hoare triple {6276#false} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {6276#false} is VALID [2018-11-23 11:08:07,223 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {6466#(or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (not (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)))} {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} #83#return; {6276#false} is VALID [2018-11-23 11:08:07,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {6466#(or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (not (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)))} assume true; {6466#(or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (not (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)))} is VALID [2018-11-23 11:08:07,250 INFO L273 TraceCheckUtils]: 47: Hoare triple {6473#(or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (not (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)) (and (= ~elem~0.base list_del_~entry.base) (= ~elem~0.offset list_del_~entry.offset)))} assume !(~entry.base == ~elem~0.base && ~entry.offset == ~elem~0.offset); {6466#(or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (not (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)))} is VALID [2018-11-23 11:08:07,264 INFO L273 TraceCheckUtils]: 46: Hoare triple {6477#(or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (and (= ~elem~0.offset |list_del_#in~entry.offset|) (= ~elem~0.base |list_del_#in~entry.base|)) (not (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset; {6473#(or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (not (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)) (and (= ~elem~0.base list_del_~entry.base) (= ~elem~0.offset list_del_~entry.offset)))} is VALID [2018-11-23 11:08:07,278 INFO L256 TraceCheckUtils]: 45: Hoare triple {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} call list_del(~dev2~0.base, ~dev2~0.offset); {6477#(or (not (= |old(~elem~0.base)| |list_del_#in~entry.base|)) (and (= ~elem~0.offset |list_del_#in~entry.offset|) (= ~elem~0.base |list_del_#in~entry.base|)) (not (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)))} is VALID [2018-11-23 11:08:07,294 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} #81#return; {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:08:07,297 INFO L273 TraceCheckUtils]: 43: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} assume true; {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:07,297 INFO L273 TraceCheckUtils]: 42: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} assume !(0bv32 != #t~nondet31);havoc #t~nondet31; {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:07,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:07,303 INFO L273 TraceCheckUtils]: 40: Hoare triple {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:07,304 INFO L256 TraceCheckUtils]: 39: Hoare triple {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} call list_add(~dev1~0.base, ~dev1~0.offset, ~#head~0.base, ~#head~0.offset); {6400#(and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))} is VALID [2018-11-23 11:08:07,305 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {6389#(and (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))} {6275#true} #79#return; {6396#(and (= ~elem~0.base main_~dev2~0.base) (= ~elem~0.offset main_~dev2~0.offset))} is VALID [2018-11-23 11:08:07,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {6389#(and (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))} assume true; {6389#(and (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:08:07,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {6382#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} assume 0bv32 != #t~nondet31;havoc #t~nondet31;~elem~0.base, ~elem~0.offset := ~new.base, ~new.offset; {6389#(and (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))} is VALID [2018-11-23 11:08:07,306 INFO L273 TraceCheckUtils]: 35: Hoare triple {6382#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} assume ~new.base != ~elem~0.base || ~new.offset != ~elem~0.offset; {6382#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 11:08:07,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {6275#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {6382#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 11:08:07,306 INFO L256 TraceCheckUtils]: 33: Hoare triple {6275#true} call list_add(~dev2~0.base, ~dev2~0.offset, ~#head~0.base, ~#head~0.offset); {6275#true} is VALID [2018-11-23 11:08:07,307 INFO L273 TraceCheckUtils]: 32: Hoare triple {6275#true} assume (~dev1~0.base != 0bv32 || ~dev1~0.offset != 0bv32) && (~dev2~0.base != 0bv32 || ~dev2~0.offset != 0bv32); {6275#true} is VALID [2018-11-23 11:08:07,307 INFO L273 TraceCheckUtils]: 31: Hoare triple {6275#true} ~dev2~0.base, ~dev2~0.offset := #t~ret33.base, #t~ret33.offset;havoc #t~ret33.base, #t~ret33.offset; {6275#true} is VALID [2018-11-23 11:08:07,307 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {6275#true} {6275#true} #77#return; {6275#true} is VALID [2018-11-23 11:08:07,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:07,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {6275#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {6275#true} is VALID [2018-11-23 11:08:07,308 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {6275#true} {6275#true} #67#return; {6275#true} is VALID [2018-11-23 11:08:07,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:07,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {6275#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {6275#true} is VALID [2018-11-23 11:08:07,308 INFO L273 TraceCheckUtils]: 24: Hoare triple {6275#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {6275#true} is VALID [2018-11-23 11:08:07,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {6275#true} assume ~bvsgt32(~size, 0bv32); {6275#true} is VALID [2018-11-23 11:08:07,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {6275#true} ~size := #in~size; {6275#true} is VALID [2018-11-23 11:08:07,309 INFO L256 TraceCheckUtils]: 21: Hoare triple {6275#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {6275#true} is VALID [2018-11-23 11:08:07,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {6275#true} ~size := #in~size; {6275#true} is VALID [2018-11-23 11:08:07,309 INFO L256 TraceCheckUtils]: 19: Hoare triple {6275#true} call #t~ret33.base, #t~ret33.offset := my_malloc(8bv32); {6275#true} is VALID [2018-11-23 11:08:07,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {6275#true} ~dev1~0.base, ~dev1~0.offset := #t~ret32.base, #t~ret32.offset;havoc #t~ret32.base, #t~ret32.offset; {6275#true} is VALID [2018-11-23 11:08:07,310 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {6275#true} {6275#true} #75#return; {6275#true} is VALID [2018-11-23 11:08:07,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:07,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {6275#true} #res.base, #res.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {6275#true} is VALID [2018-11-23 11:08:07,310 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {6275#true} {6275#true} #67#return; {6275#true} is VALID [2018-11-23 11:08:07,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:07,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {6275#true} assume !(0bv32 == #t~nondet29);havoc #t~nondet29;#res.base, #res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {6275#true} is VALID [2018-11-23 11:08:07,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {6275#true} #t~post28.base, #t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := #t~post28.base, ~bvadd32(1bv32, #t~post28.offset);havoc #t~post28.base, #t~post28.offset; {6275#true} is VALID [2018-11-23 11:08:07,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {6275#true} assume ~bvsgt32(~size, 0bv32); {6275#true} is VALID [2018-11-23 11:08:07,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {6275#true} ~size := #in~size; {6275#true} is VALID [2018-11-23 11:08:07,311 INFO L256 TraceCheckUtils]: 8: Hoare triple {6275#true} call #t~ret30.base, #t~ret30.offset := __getMemory(~size); {6275#true} is VALID [2018-11-23 11:08:07,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {6275#true} ~size := #in~size; {6275#true} is VALID [2018-11-23 11:08:07,311 INFO L256 TraceCheckUtils]: 6: Hoare triple {6275#true} call #t~ret32.base, #t~ret32.offset := my_malloc(8bv32); {6275#true} is VALID [2018-11-23 11:08:07,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {6275#true} havoc ~dev1~0.base, ~dev1~0.offset;havoc ~dev2~0.base, ~dev2~0.offset; {6275#true} is VALID [2018-11-23 11:08:07,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {6275#true} call #t~ret34 := main(); {6275#true} is VALID [2018-11-23 11:08:07,312 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6275#true} {6275#true} #71#return; {6275#true} is VALID [2018-11-23 11:08:07,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {6275#true} assume true; {6275#true} is VALID [2018-11-23 11:08:07,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {6275#true} ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0bv32, 0bv32;~elem~0.base, ~elem~0.offset := 0bv32, 0bv32;call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32); {6275#true} is VALID [2018-11-23 11:08:07,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {6275#true} call ULTIMATE.init(); {6275#true} is VALID [2018-11-23 11:08:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (12)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:08:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:07,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-11-23 11:08:07,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-23 11:08:07,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:07,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:08:07,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:07,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:08:07,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:08:07,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:08:07,383 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 11 states. [2018-11-23 11:08:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:08,586 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 11:08:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:08:08,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-23 11:08:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:08:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-23 11:08:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:08:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-23 11:08:08,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2018-11-23 11:08:08,649 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-23 11:08:08,650 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:08:08,650 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:08:08,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:08:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:08:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:08:08,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:08,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:08,652 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:08,652 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:08,652 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:08:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:08,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:08,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:08,653 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:08,653 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:08,653 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:08:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:08,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:08,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:08,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:08,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:08:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:08:08,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-11-23 11:08:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:08,654 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:08:08,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:08:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:08,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:08,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:08:08,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:08:09,436 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2018-11-23 11:08:09,686 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2018-11-23 11:08:09,830 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2018-11-23 11:08:09,994 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 10 [2018-11-23 11:08:10,557 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 24 [2018-11-23 11:08:10,704 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-23 11:08:11,122 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 22 [2018-11-23 11:08:11,358 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 7 [2018-11-23 11:08:11,971 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2018-11-23 11:08:12,506 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2018-11-23 11:08:12,693 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2018-11-23 11:08:12,786 INFO L448 ceAbstractionStarter]: For program point my_mallocFINAL(lines 878 880) no Hoare annotation was computed. [2018-11-23 11:08:12,786 INFO L444 ceAbstractionStarter]: At program point L879(line 879) the Hoare annotation is: (let ((.cse0 (= (bvadd my_malloc_~size (_ bv4294967288 32)) (_ bv0 32))) (.cse1 (not (= ~elem~0.offset (_ bv0 32)))) (.cse2 (not (= (bvadd |my_malloc_#in~size| (_ bv4294967288 32)) (_ bv0 32))))) (and (or (and (= (_ bv0 32) ~guard_malloc_counter~0.offset) .cse0) .cse1 .cse2 (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|))) (or (and (= (_ bv1 32) ~guard_malloc_counter~0.offset) .cse0) (or .cse1 (not (= (_ bv1 32) |old(~guard_malloc_counter~0.offset)|)) .cse2)))) [2018-11-23 11:08:12,786 INFO L448 ceAbstractionStarter]: For program point L879-1(line 879) no Hoare annotation was computed. [2018-11-23 11:08:12,787 INFO L444 ceAbstractionStarter]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= ~elem~0.offset (_ bv0 32)))) (.cse1 (not (= (bvadd |my_malloc_#in~size| (_ bv4294967288 32)) (_ bv0 32))))) (and (or .cse0 (= (_ bv0 32) ~guard_malloc_counter~0.offset) .cse1 (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|))) (or (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)) (or .cse0 (not (= (_ bv1 32) |old(~guard_malloc_counter~0.offset)|)) .cse1)))) [2018-11-23 11:08:12,787 INFO L448 ceAbstractionStarter]: For program point my_mallocEXIT(lines 878 880) no Hoare annotation was computed. [2018-11-23 11:08:12,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:08:12,787 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= |old(~elem~0.offset)| ~elem~0.offset)) [2018-11-23 11:08:12,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:08:12,787 INFO L448 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2018-11-23 11:08:12,787 INFO L448 ceAbstractionStarter]: For program point L896-2(lines 895 898) no Hoare annotation was computed. [2018-11-23 11:08:12,787 INFO L448 ceAbstractionStarter]: For program point list_delEXIT(lines 895 898) no Hoare annotation was computed. [2018-11-23 11:08:12,787 INFO L444 ceAbstractionStarter]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) [2018-11-23 11:08:12,788 INFO L444 ceAbstractionStarter]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse0 (not (= (_ bv1 32) |list_add_#in~new.offset|))) (.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse4 (= ~elem~0.offset (_ bv0 32))) (.cse3 (not (= |old(~elem~0.offset)| (_ bv0 32)))) (.cse5 (not (= (_ bv2 32) |list_add_#in~new.offset|)))) (and (or (not (= (bvadd |old(~elem~0.offset)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd |old(~elem~0.offset)| (_ bv1 32)) |list_add_#in~new.offset|)) (= (_ bv1 32) ~elem~0.offset)) (or .cse0 (and .cse1 .cse2) (not (= (bvadd |old(~elem~0.offset)| (_ bv4294967294 32)) (_ bv0 32)))) (or (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset) (= |old(~elem~0.offset)| |list_add_#in~new.offset|) .cse3 .cse4 (= (_ bv4294967294 32) ~guard_malloc_counter~0.offset)) (or .cse3 .cse2 .cse0) (or .cse1 .cse3 .cse5) (or .cse4 .cse3 .cse5))) [2018-11-23 11:08:12,788 INFO L448 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-11-23 11:08:12,788 INFO L448 ceAbstractionStarter]: For program point L891-1(lines 889 893) no Hoare annotation was computed. [2018-11-23 11:08:12,788 INFO L444 ceAbstractionStarter]: At program point L890-2(line 890) the Hoare annotation is: (let ((.cse1 (not (= (_ bv1 32) |list_add_#in~new.offset|))) (.cse0 (not (= |old(~elem~0.offset)| (_ bv0 32))))) (and (or (not (= (bvadd |old(~elem~0.offset)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd |old(~elem~0.offset)| (_ bv1 32)) |list_add_#in~new.offset|))) (or .cse0 .cse1) (or .cse1 (not (= (bvadd |old(~elem~0.offset)| (_ bv4294967294 32)) (_ bv0 32)))) (or (= (_ bv4294967295 32) ~guard_malloc_counter~0.offset) (= |old(~elem~0.offset)| |list_add_#in~new.offset|) .cse0 (= (_ bv4294967294 32) ~guard_malloc_counter~0.offset)) (or .cse0 (not (= (_ bv2 32) |list_add_#in~new.offset|))))) [2018-11-23 11:08:12,788 INFO L448 ceAbstractionStarter]: For program point L890-3(lines 889 893) no Hoare annotation was computed. [2018-11-23 11:08:12,788 INFO L448 ceAbstractionStarter]: For program point list_addEXIT(lines 889 893) no Hoare annotation was computed. [2018-11-23 11:08:12,789 INFO L448 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-23 11:08:12,789 INFO L448 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 11:08:12,789 INFO L448 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-23 11:08:12,789 INFO L451 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-23 11:08:12,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:08:12,789 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32))) [2018-11-23 11:08:12,789 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:08:12,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:08:12,790 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (not (= |old(~elem~0.offset)| (_ bv0 32))) (and (= |old(~elem~0.base)| ~elem~0.base) (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32))) (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|))) [2018-11-23 11:08:12,790 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 902 917) no Hoare annotation was computed. [2018-11-23 11:08:12,790 INFO L444 ceAbstractionStarter]: At program point L909(line 909) the Hoare annotation is: (or (not (= |old(~elem~0.offset)| (_ bv0 32))) (and (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))) (and (and (not (= (_ bv0 32) ~guard_malloc_counter~0.offset)) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))) (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) ~elem~0.offset) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset) (= (_ bv1 32) ~elem~0.offset)) (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|))) [2018-11-23 11:08:12,790 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 902 917) no Hoare annotation was computed. [2018-11-23 11:08:12,790 INFO L444 ceAbstractionStarter]: At program point L908(line 908) the Hoare annotation is: (let ((.cse0 (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))) (.cse1 (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv0 32) ~guard_malloc_counter~0.offset))) (.cse3 (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset))) (or (not (= |old(~elem~0.offset)| (_ bv0 32))) (and (= ~elem~0.offset (_ bv0 32)) .cse0) (and (= ~elem~0.base main_~dev2~0.base) .cse1 .cse2 (= ~elem~0.offset main_~dev2~0.offset) .cse3 .cse0) (and .cse1 (= (bvadd main_~dev2~0.offset (_ bv4294967295 32)) ~elem~0.offset) .cse2 .cse3 (= (_ bv1 32) ~elem~0.offset)) (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|)))) [2018-11-23 11:08:12,791 INFO L444 ceAbstractionStarter]: At program point L907(line 907) the Hoare annotation is: (or (not (= |old(~elem~0.offset)| (_ bv0 32))) (and (= |old(~elem~0.base)| ~elem~0.base) (not (= (_ bv0 32) ~guard_malloc_counter~0.offset)) (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset) (= ~elem~0.offset (_ bv0 32)) (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32)) (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32)))) (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|))) [2018-11-23 11:08:12,791 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2018-11-23 11:08:12,791 INFO L444 ceAbstractionStarter]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) ~guard_malloc_counter~0.offset))) (.cse1 (= (bvadd main_~dev1~0.offset (_ bv1 32)) main_~dev2~0.offset)) (.cse2 (= (bvadd main_~dev2~0.offset (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (not (= (bvadd ~guard_malloc_counter~0.offset (_ bv1 32)) (_ bv0 32))))) (or (and (= ~elem~0.base main_~dev2~0.base) .cse0 (= ~elem~0.offset main_~dev2~0.offset) .cse1 .cse2 .cse3) (not (= |old(~elem~0.offset)| (_ bv0 32))) (and .cse0 .cse1 .cse2 (= ~elem~0.offset (_ bv0 32)) .cse3) (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|)))) [2018-11-23 11:08:12,791 INFO L444 ceAbstractionStarter]: At program point L905(line 905) the Hoare annotation is: (let ((.cse0 (= ~elem~0.offset (_ bv0 32))) (.cse1 (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)))) (or (and (= (bvadd main_~dev1~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= |old(~elem~0.base)| ~elem~0.base) .cse0 .cse1) (not (= |old(~elem~0.offset)| (_ bv0 32))) (and (= main_~dev1~0.offset (_ bv0 32)) (= (_ bv0 32) main_~dev1~0.base) .cse0 .cse1) (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|)))) [2018-11-23 11:08:12,791 INFO L448 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2018-11-23 11:08:12,791 INFO L444 ceAbstractionStarter]: At program point L904(line 904) the Hoare annotation is: (or (not (= |old(~elem~0.offset)| (_ bv0 32))) (and (= |old(~elem~0.base)| ~elem~0.base) (= (_ bv0 32) ~guard_malloc_counter~0.offset) (= ~elem~0.offset (_ bv0 32))) (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|))) [2018-11-23 11:08:12,791 INFO L448 ceAbstractionStarter]: For program point L905-1(line 905) no Hoare annotation was computed. [2018-11-23 11:08:12,792 INFO L448 ceAbstractionStarter]: For program point L904-1(line 904) no Hoare annotation was computed. [2018-11-23 11:08:12,792 INFO L444 ceAbstractionStarter]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (let ((.cse1 (not (= (_ bv8 32) |__getMemory_#in~size|))) (.cse0 (not (= ~elem~0.offset (_ bv0 32))))) (and (or .cse0 .cse1 (= (_ bv0 32) ~guard_malloc_counter~0.offset) (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|))) (or (= (bvadd ~guard_malloc_counter~0.offset (_ bv4294967295 32)) (_ bv0 32)) .cse1 .cse0 (not (= (_ bv1 32) |old(~guard_malloc_counter~0.offset)|))))) [2018-11-23 11:08:12,792 INFO L448 ceAbstractionStarter]: For program point __getMemoryEXIT(lines 869 876) no Hoare annotation was computed. [2018-11-23 11:08:12,792 INFO L448 ceAbstractionStarter]: For program point __getMemoryFINAL(lines 869 876) no Hoare annotation was computed. [2018-11-23 11:08:12,792 INFO L448 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2018-11-23 11:08:12,792 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-23 11:08:12,792 INFO L444 ceAbstractionStarter]: At program point L871-2(line 871) the Hoare annotation is: (let ((.cse1 (not (= (_ bv8 32) |__getMemory_#in~size|))) (.cse0 (not (= ~elem~0.offset (_ bv0 32))))) (and (or .cse0 .cse1 (not (= (_ bv0 32) |old(~guard_malloc_counter~0.offset)|))) (or .cse1 .cse0 (not (= (_ bv1 32) |old(~guard_malloc_counter~0.offset)|))))) [2018-11-23 11:08:12,792 INFO L448 ceAbstractionStarter]: For program point L871-3(line 871) no Hoare annotation was computed. [2018-11-23 11:08:12,802 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:08:12,802 WARN L170 areAnnotationChecker]: L896 has no Hoare annotation [2018-11-23 11:08:12,802 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-23 11:08:12,802 WARN L170 areAnnotationChecker]: __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:08:12,802 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 11:08:12,803 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2018-11-23 11:08:12,803 WARN L170 areAnnotationChecker]: L879-1 has no Hoare annotation [2018-11-23 11:08:12,804 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:08:12,804 WARN L170 areAnnotationChecker]: L896 has no Hoare annotation [2018-11-23 11:08:12,805 WARN L170 areAnnotationChecker]: L896 has no Hoare annotation [2018-11-23 11:08:12,805 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-23 11:08:12,805 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2018-11-23 11:08:12,805 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 11:08:12,805 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:08:12,805 WARN L170 areAnnotationChecker]: L904-1 has no Hoare annotation [2018-11-23 11:08:12,806 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2018-11-23 11:08:12,807 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2018-11-23 11:08:12,807 WARN L170 areAnnotationChecker]: L879-1 has no Hoare annotation [2018-11-23 11:08:12,807 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:08:12,807 WARN L170 areAnnotationChecker]: L896-2 has no Hoare annotation [2018-11-23 11:08:12,807 WARN L170 areAnnotationChecker]: L890-3 has no Hoare annotation [2018-11-23 11:08:12,807 WARN L170 areAnnotationChecker]: L890-3 has no Hoare annotation [2018-11-23 11:08:12,807 WARN L170 areAnnotationChecker]: L890-3 has no Hoare annotation [2018-11-23 11:08:12,807 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 11:08:12,808 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 11:08:12,808 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:08:12,808 WARN L170 areAnnotationChecker]: L904-1 has no Hoare annotation [2018-11-23 11:08:12,808 WARN L170 areAnnotationChecker]: L871-3 has no Hoare annotation [2018-11-23 11:08:12,808 WARN L170 areAnnotationChecker]: L871-3 has no Hoare annotation [2018-11-23 11:08:12,808 WARN L170 areAnnotationChecker]: my_mallocFINAL has no Hoare annotation [2018-11-23 11:08:12,808 WARN L170 areAnnotationChecker]: list_delEXIT has no Hoare annotation [2018-11-23 11:08:12,808 WARN L170 areAnnotationChecker]: L891-1 has no Hoare annotation [2018-11-23 11:08:12,809 WARN L170 areAnnotationChecker]: L905-1 has no Hoare annotation [2018-11-23 11:08:12,810 WARN L170 areAnnotationChecker]: L873 has no Hoare annotation [2018-11-23 11:08:12,810 WARN L170 areAnnotationChecker]: L873 has no Hoare annotation [2018-11-23 11:08:12,810 WARN L170 areAnnotationChecker]: my_mallocEXIT has no Hoare annotation [2018-11-23 11:08:12,810 WARN L170 areAnnotationChecker]: my_mallocEXIT has no Hoare annotation [2018-11-23 11:08:12,810 WARN L170 areAnnotationChecker]: L906-1 has no Hoare annotation [2018-11-23 11:08:12,811 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2018-11-23 11:08:12,811 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2018-11-23 11:08:12,812 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2018-11-23 11:08:12,812 WARN L170 areAnnotationChecker]: L905-1 has no Hoare annotation [2018-11-23 11:08:12,812 WARN L170 areAnnotationChecker]: __getMemoryFINAL has no Hoare annotation [2018-11-23 11:08:12,812 WARN L170 areAnnotationChecker]: L906-1 has no Hoare annotation [2018-11-23 11:08:12,814 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2018-11-23 11:08:12,814 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2018-11-23 11:08:12,814 WARN L170 areAnnotationChecker]: __getMemoryEXIT has no Hoare annotation [2018-11-23 11:08:12,815 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:08:12,817 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:08:12,817 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:08:12,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:08:12 BoogieIcfgContainer [2018-11-23 11:08:12,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:08:12,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:08:12,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:08:12,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:08:12,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:46" (3/4) ... [2018-11-23 11:08:12,826 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:08:12,833 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_malloc [2018-11-23 11:08:12,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:08:12,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2018-11-23 11:08:12,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2018-11-23 11:08:12,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-11-23 11:08:12,835 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:08:12,835 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __getMemory [2018-11-23 11:08:12,840 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-23 11:08:12,841 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 11:08:12,841 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:08:12,911 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i-witness.graphml [2018-11-23 11:08:12,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:08:12,913 INFO L168 Benchmark]: Toolchain (without parser) took 88584.38 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -357.6 MB). Peak memory consumption was 864.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:12,914 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:12,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.06 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:12,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:12,915 INFO L168 Benchmark]: Boogie Preprocessor took 36.20 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:12,915 INFO L168 Benchmark]: RCFGBuilder took 886.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:12,915 INFO L168 Benchmark]: TraceAbstraction took 86771.08 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 489.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 398.5 MB). Peak memory consumption was 887.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:12,916 INFO L168 Benchmark]: Witness Printer took 90.34 ms. Allocated memory is still 2.8 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:12,918 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 671.06 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 119.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.20 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 886.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86771.08 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 489.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 398.5 MB). Peak memory consumption was 887.6 MB. Max. memory is 7.1 GB. * Witness Printer took 90.34 ms. Allocated memory is still 2.8 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 46 locations, 1 error locations. SAFE Result, 86.6s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 62.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 446 SDtfs, 554 SDslu, 2006 SDs, 0 SdLazy, 6544 SolverSat, 547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 627 SyntacticMatches, 4 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2881 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=5, 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: 2.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 75 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 81 PreInvPairs, 95 NumberOfFragments, 618 HoareAnnotationTreeSize, 81 FomulaSimplifications, 1809 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1563 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 808 ConstructedInterpolants, 0 QuantifiedInterpolants, 161212 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 171/266 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...