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/heap-data/quick_sort_split_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:19:42,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:19:42,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:19:42,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:19:42,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:19:42,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:19:42,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:19:42,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:19:42,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:19:42,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:19:42,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:19:42,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:19:42,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:19:42,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:19:42,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:19:42,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:19:42,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:19:42,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:19:42,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:19:42,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:19:42,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:19:42,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:19:42,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:19:42,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:19:42,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:19:42,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:19:42,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:19:42,319 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:19:42,320 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:19:42,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:19:42,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:19:42,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:19:42,322 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:19:42,323 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:19:42,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:19:42,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:19:42,325 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:19:42,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:19:42,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:19:42,359 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:19:42,359 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:19:42,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:19:42,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:19:42,362 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:19:42,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:19:42,363 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:19:42,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:19:42,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:19:42,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:19:42,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:19:42,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:19:42,364 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:19:42,364 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:19:42,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:19:42,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:19:42,365 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:19:42,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:19:42,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:19:42,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:19:42,366 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:19:42,366 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:19:42,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:19:42,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:19:42,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:19:42,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:19:42,369 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:19:42,369 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:19:42,369 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:19:42,369 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:19:42,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:19:42,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:19:42,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:19:42,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:19:42,465 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:19:42,466 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:19:42,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/quick_sort_split_true-unreach-call.i [2018-11-23 11:19:42,531 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8820357b5/013f60f90acd40e99197edef26a18d92/FLAG37318420a [2018-11-23 11:19:43,111 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:19:43,112 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/quick_sort_split_true-unreach-call.i [2018-11-23 11:19:43,129 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8820357b5/013f60f90acd40e99197edef26a18d92/FLAG37318420a [2018-11-23 11:19:43,352 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8820357b5/013f60f90acd40e99197edef26a18d92 [2018-11-23 11:19:43,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:19:43,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:19:43,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:43,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:19:43,369 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:19:43,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:43" (1/1) ... [2018-11-23 11:19:43,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36aaa43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:43, skipping insertion in model container [2018-11-23 11:19:43,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:43" (1/1) ... [2018-11-23 11:19:43,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:19:43,442 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:19:43,946 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:43,968 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:19:44,046 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:44,185 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:19:44,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44 WrapperNode [2018-11-23 11:19:44,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:44,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:44,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:19:44,187 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:19:44,196 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:19:44" (1/1) ... [2018-11-23 11:19:44,216 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:19:44" (1/1) ... [2018-11-23 11:19:44,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:44,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:19:44,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:19:44,227 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:19:44,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (1/1) ... [2018-11-23 11:19:44,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (1/1) ... [2018-11-23 11:19:44,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (1/1) ... [2018-11-23 11:19:44,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (1/1) ... [2018-11-23 11:19:44,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (1/1) ... [2018-11-23 11:19:44,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (1/1) ... [2018-11-23 11:19:44,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (1/1) ... [2018-11-23 11:19:44,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:19:44,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:19:44,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:19:44,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:19:44,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (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:19:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:19:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:19:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:19:44,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:19:44,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:19:44,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:19:44,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:19:44,362 INFO L130 BoogieDeclarations]: Found specification of procedure create_list [2018-11-23 11:19:44,362 INFO L138 BoogieDeclarations]: Found implementation of procedure create_list [2018-11-23 11:19:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:19:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:19:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:19:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:19:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_list [2018-11-23 11:19:44,364 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_list [2018-11-23 11:19:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:19:44,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:19:45,400 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:19:45,400 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:19:45,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:45 BoogieIcfgContainer [2018-11-23 11:19:45,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:19:45,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:19:45,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:19:45,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:19:45,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:19:43" (1/3) ... [2018-11-23 11:19:45,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fb5ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:45, skipping insertion in model container [2018-11-23 11:19:45,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:44" (2/3) ... [2018-11-23 11:19:45,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fb5ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:45, skipping insertion in model container [2018-11-23 11:19:45,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:45" (3/3) ... [2018-11-23 11:19:45,410 INFO L112 eAbstractionObserver]: Analyzing ICFG quick_sort_split_true-unreach-call.i [2018-11-23 11:19:45,421 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:19:45,430 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 11:19:45,449 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 11:19:45,481 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:19:45,481 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:19:45,482 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:19:45,482 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:19:45,482 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:19:45,482 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:19:45,482 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:19:45,482 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:19:45,483 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:19:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 11:19:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:19:45,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:45,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:45,508 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:45,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:45,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1647605572, now seen corresponding path program 1 times [2018-11-23 11:19:45,520 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:45,521 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:19:45,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:45,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:45,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 11:19:45,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {38#true} is VALID [2018-11-23 11:19:45,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 11:19:45,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #97#return; {38#true} is VALID [2018-11-23 11:19:45,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2018-11-23 11:19:45,843 INFO L256 TraceCheckUtils]: 5: Hoare triple {38#true} call #t~ret7.base, #t~ret7.offset := create_list(); {38#true} is VALID [2018-11-23 11:19:45,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32); {38#true} is VALID [2018-11-23 11:19:45,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 11:19:45,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#false} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {39#false} is VALID [2018-11-23 11:19:45,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2018-11-23 11:19:45,846 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #101#return; {39#false} is VALID [2018-11-23 11:19:45,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0bv32, 0bv32;~high~0.base, ~high~0.offset := 0bv32, 0bv32;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {39#false} is VALID [2018-11-23 11:19:45,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {39#false} is VALID [2018-11-23 11:19:45,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} assume !!(~low~0.base != 0bv32 || ~low~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~low~0.base, ~low~0.offset, 4bv32); {39#false} is VALID [2018-11-23 11:19:45,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume !(4294967295bv32 == #t~mem11);havoc #t~mem11; {39#false} is VALID [2018-11-23 11:19:45,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 11:19:45,852 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:19:45,852 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Stream closed [2018-11-23 11:19:45,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:45,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:19:45,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:19:45,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:45,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:19:45,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:45,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:19:45,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:19:45,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:19:45,953 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 11:19:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:46,874 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2018-11-23 11:19:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:19:46,875 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:19:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:19:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-23 11:19:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:19:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-23 11:19:46,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-23 11:19:47,239 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:19:47,253 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:19:47,253 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:19:47,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:19:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:19:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 11:19:47,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:47,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 11:19:47,428 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:19:47,428 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:19:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:47,435 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 11:19:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 11:19:47,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:47,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:47,437 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:19:47,437 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:19:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:47,443 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 11:19:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 11:19:47,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:47,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:47,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:47,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:19:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-23 11:19:47,451 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2018-11-23 11:19:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:47,451 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 11:19:47,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:19:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 11:19:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:19:47,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:47,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:47,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:47,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:47,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1862222648, now seen corresponding path program 1 times [2018-11-23 11:19:47,454 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:47,455 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:19:47,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:47,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:47,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {257#true} is VALID [2018-11-23 11:19:47,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {257#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {257#true} is VALID [2018-11-23 11:19:47,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2018-11-23 11:19:47,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #97#return; {257#true} is VALID [2018-11-23 11:19:47,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret15 := main(); {257#true} is VALID [2018-11-23 11:19:47,916 INFO L256 TraceCheckUtils]: 5: Hoare triple {257#true} call #t~ret7.base, #t~ret7.offset := create_list(); {257#true} is VALID [2018-11-23 11:19:47,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32); {257#true} is VALID [2018-11-23 11:19:47,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {257#true} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {257#true} is VALID [2018-11-23 11:19:47,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {257#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {257#true} is VALID [2018-11-23 11:19:47,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {257#true} assume true; {257#true} is VALID [2018-11-23 11:19:47,918 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {257#true} {257#true} #101#return; {257#true} is VALID [2018-11-23 11:19:47,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {257#true} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0bv32, 0bv32;~high~0.base, ~high~0.offset := 0bv32, 0bv32;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {295#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} is VALID [2018-11-23 11:19:47,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {295#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {295#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} is VALID [2018-11-23 11:19:47,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {295#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} assume !!(~low~0.base != 0bv32 || ~low~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~low~0.base, ~low~0.offset, 4bv32); {258#false} is VALID [2018-11-23 11:19:47,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {258#false} assume !(4294967295bv32 == #t~mem11);havoc #t~mem11; {258#false} is VALID [2018-11-23 11:19:47,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {258#false} assume !false; {258#false} is VALID [2018-11-23 11:19:47,952 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:19:47,953 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:47,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:47,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:19:47,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:19:47,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:47,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:19:48,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:48,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:19:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:19:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:19:48,014 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2018-11-23 11:19:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:49,237 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 11:19:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:19:49,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:19:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:19:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2018-11-23 11:19:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:19:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2018-11-23 11:19:49,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2018-11-23 11:19:49,419 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:19:49,423 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:19:49,424 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:19:49,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:19:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:19:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:19:49,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:49,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:19:49,438 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:19:49,438 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:19:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:49,441 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 11:19:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 11:19:49,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:49,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:49,442 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:19:49,442 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:19:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:49,446 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 11:19:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 11:19:49,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:49,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:49,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:49,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:19:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 11:19:49,450 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2018-11-23 11:19:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:49,451 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 11:19:49,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:19:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 11:19:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:19:49,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:49,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:49,452 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:49,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1894284664, now seen corresponding path program 1 times [2018-11-23 11:19:49,453 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:49,453 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:19:49,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:49,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:49,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-23 11:19:49,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {445#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {445#true} is VALID [2018-11-23 11:19:49,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 11:19:49,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #97#return; {445#true} is VALID [2018-11-23 11:19:49,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret15 := main(); {445#true} is VALID [2018-11-23 11:19:49,618 INFO L256 TraceCheckUtils]: 5: Hoare triple {445#true} call #t~ret7.base, #t~ret7.offset := create_list(); {445#true} is VALID [2018-11-23 11:19:49,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {445#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32); {445#true} is VALID [2018-11-23 11:19:49,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {445#true} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {445#true} is VALID [2018-11-23 11:19:49,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {445#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {445#true} is VALID [2018-11-23 11:19:49,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 11:19:49,619 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {445#true} {445#true} #101#return; {445#true} is VALID [2018-11-23 11:19:49,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {445#true} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0bv32, 0bv32;~high~0.base, ~high~0.offset := 0bv32, 0bv32;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {483#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-23 11:19:49,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {483#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {483#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-23 11:19:49,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {483#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume !(~low~0.base != 0bv32 || ~low~0.offset != 0bv32); {483#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-23 11:19:49,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {483#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume !!(~high~0.base != 0bv32 || ~high~0.offset != 0bv32);call #t~mem13 := read~intINTTYPE4(~high~0.base, ~high~0.offset, 4bv32); {446#false} is VALID [2018-11-23 11:19:49,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {446#false} assume !(1bv32 == #t~mem13);havoc #t~mem13; {446#false} is VALID [2018-11-23 11:19:49,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-23 11:19:49,628 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:19:49,629 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:49,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:49,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:19:49,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:19:49,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:49,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:19:49,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:49,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:19:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:19:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:19:49,672 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2018-11-23 11:19:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:51,441 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 11:19:51,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:19:51,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:19:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:19:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-23 11:19:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:19:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-23 11:19:51,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2018-11-23 11:19:51,586 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:19:51,587 INFO L225 Difference]: With dead ends: 28 [2018-11-23 11:19:51,587 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:19:51,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:19:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:19:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:19:51,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:51,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:19:51,591 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:19:51,591 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:19:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:51,592 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:19:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:19:51,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:51,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:51,592 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:19:51,593 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:19:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:51,593 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:19:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:19:51,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:51,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:51,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:51,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:19:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:19:51,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-23 11:19:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:51,595 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:19:51,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:19:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:19:51,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:51,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:19:51,815 INFO L451 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: true [2018-11-23 11:19:51,816 INFO L451 ceAbstractionStarter]: At program point L576-1(lines 571 577) the Hoare annotation is: true [2018-11-23 11:19:51,816 INFO L451 ceAbstractionStarter]: At program point L574(line 574) the Hoare annotation is: true [2018-11-23 11:19:51,816 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 576) no Hoare annotation was computed. [2018-11-23 11:19:51,816 INFO L448 ceAbstractionStarter]: For program point L571-2(lines 571 577) no Hoare annotation was computed. [2018-11-23 11:19:51,816 INFO L448 ceAbstractionStarter]: For program point create_listEXIT(lines 569 579) no Hoare annotation was computed. [2018-11-23 11:19:51,816 INFO L451 ceAbstractionStarter]: At program point create_listENTRY(lines 569 579) the Hoare annotation is: true [2018-11-23 11:19:51,816 INFO L448 ceAbstractionStarter]: For program point create_listFINAL(lines 569 579) no Hoare annotation was computed. [2018-11-23 11:19:51,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:19:51,817 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:19:51,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:19:51,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:19:51,817 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:19:51,817 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:19:51,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:19:51,817 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 580 602) no Hoare annotation was computed. [2018-11-23 11:19:51,817 INFO L448 ceAbstractionStarter]: For program point L597-1(lines 580 602) no Hoare annotation was computed. [2018-11-23 11:19:51,818 INFO L448 ceAbstractionStarter]: For program point L597-2(lines 580 602) no Hoare annotation was computed. [2018-11-23 11:19:51,818 INFO L448 ceAbstractionStarter]: For program point L593(lines 593 594) no Hoare annotation was computed. [2018-11-23 11:19:51,818 INFO L448 ceAbstractionStarter]: For program point L593-2(lines 593 594) no Hoare annotation was computed. [2018-11-23 11:19:51,818 INFO L444 ceAbstractionStarter]: At program point L585-2(lines 585 591) the Hoare annotation is: (and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset) (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base)) [2018-11-23 11:19:51,818 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2018-11-23 11:19:51,818 INFO L448 ceAbstractionStarter]: For program point L581(line 581) no Hoare annotation was computed. [2018-11-23 11:19:51,819 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 594) no Hoare annotation was computed. [2018-11-23 11:19:51,819 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 599) no Hoare annotation was computed. [2018-11-23 11:19:51,819 INFO L448 ceAbstractionStarter]: For program point L598-2(lines 598 599) no Hoare annotation was computed. [2018-11-23 11:19:51,819 INFO L448 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-11-23 11:19:51,819 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-23 11:19:51,819 INFO L448 ceAbstractionStarter]: For program point L586-2(line 586) no Hoare annotation was computed. [2018-11-23 11:19:51,819 INFO L448 ceAbstractionStarter]: For program point L599(line 599) no Hoare annotation was computed. [2018-11-23 11:19:51,819 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 580 602) the Hoare annotation is: true [2018-11-23 11:19:51,819 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 580 602) no Hoare annotation was computed. [2018-11-23 11:19:51,820 INFO L448 ceAbstractionStarter]: For program point append_to_listEXIT(lines 562 568) no Hoare annotation was computed. [2018-11-23 11:19:51,820 INFO L451 ceAbstractionStarter]: At program point append_to_listENTRY(lines 562 568) the Hoare annotation is: true [2018-11-23 11:19:51,820 INFO L448 ceAbstractionStarter]: For program point append_to_listFINAL(lines 562 568) no Hoare annotation was computed. [2018-11-23 11:19:51,822 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:19:51,822 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-23 11:19:51,822 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2018-11-23 11:19:51,822 WARN L170 areAnnotationChecker]: L571-2 has no Hoare annotation [2018-11-23 11:19:51,822 WARN L170 areAnnotationChecker]: L571-2 has no Hoare annotation [2018-11-23 11:19:51,822 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2018-11-23 11:19:51,823 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:19:51,823 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:19:51,823 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-23 11:19:51,823 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2018-11-23 11:19:51,823 WARN L170 areAnnotationChecker]: L571-2 has no Hoare annotation [2018-11-23 11:19:51,823 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2018-11-23 11:19:51,824 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2018-11-23 11:19:51,824 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:19:51,824 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:19:51,824 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 11:19:51,824 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 11:19:51,824 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 11:19:51,824 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2018-11-23 11:19:51,825 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2018-11-23 11:19:51,825 WARN L170 areAnnotationChecker]: create_listFINAL has no Hoare annotation [2018-11-23 11:19:51,825 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 11:19:51,825 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 11:19:51,825 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 11:19:51,825 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 11:19:51,826 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 11:19:51,826 WARN L170 areAnnotationChecker]: create_listEXIT has no Hoare annotation [2018-11-23 11:19:51,826 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-23 11:19:51,826 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-23 11:19:51,826 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-23 11:19:51,826 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-23 11:19:51,826 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-23 11:19:51,827 WARN L170 areAnnotationChecker]: L586-2 has no Hoare annotation [2018-11-23 11:19:51,827 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2018-11-23 11:19:51,827 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-23 11:19:51,827 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-23 11:19:51,827 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-23 11:19:51,827 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-23 11:19:51,827 WARN L170 areAnnotationChecker]: L593-2 has no Hoare annotation [2018-11-23 11:19:51,827 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:19:51,828 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-23 11:19:51,828 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-23 11:19:51,828 WARN L170 areAnnotationChecker]: L598-2 has no Hoare annotation [2018-11-23 11:19:51,828 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:19:51,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:19:51 BoogieIcfgContainer [2018-11-23 11:19:51,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:19:51,840 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:19:51,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:19:51,841 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:19:51,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:45" (3/4) ... [2018-11-23 11:19:51,845 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:19:51,853 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure create_list [2018-11-23 11:19:51,853 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:19:51,854 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:19:51,854 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure append_to_list [2018-11-23 11:19:51,860 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 11:19:51,860 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 11:19:51,861 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:19:51,935 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/heap-data/quick_sort_split_true-unreach-call.i-witness.graphml [2018-11-23 11:19:51,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:19:51,937 INFO L168 Benchmark]: Toolchain (without parser) took 8574.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -555.2 MB). Peak memory consumption was 176.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:19:51,939 INFO L168 Benchmark]: CDTParser took 0.24 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:19:51,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.3 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:19:51,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.65 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:19:51,941 INFO L168 Benchmark]: Boogie Preprocessor took 53.79 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:19:51,941 INFO L168 Benchmark]: RCFGBuilder took 1120.66 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:19:51,942 INFO L168 Benchmark]: TraceAbstraction took 6437.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 184.5 MB). Peak memory consumption was 184.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:19:51,943 INFO L168 Benchmark]: Witness Printer took 95.46 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:19:51,950 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.24 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 821.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.3 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.65 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.79 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 1120.66 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6437.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 184.5 MB). Peak memory consumption was 184.5 MB. Max. memory is 7.1 GB. * Witness Printer took 95.46 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 594]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((high == 0bv32 && 0bv32 == high) && low == 0bv32) && 0bv32 == low - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 2 error locations. SAFE Result, 6.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 97 SDtfs, 14 SDslu, 40 SDs, 0 SdLazy, 3 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 11 PreInvPairs, 12 NumberOfFragments, 22 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 4 NumberOfNonLiveVariables, 194 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...