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_Default.epf -i ../../../trunk/examples/svcomp/heap-data/quick_sort_split_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:37,236 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:37,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:37,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:37,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:37,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:37,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:37,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:37,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:37,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:37,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:37,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:37,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:37,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:37,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:37,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:37,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:37,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:37,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:37,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:37,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:37,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:37,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:37,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:37,305 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:37,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:37,308 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:37,309 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:37,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:37,313 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:37,313 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:37,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:37,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:37,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:37,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:37,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:37,320 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:00:37,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:37,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:37,350 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:37,350 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:37,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:37,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:37,352 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:37,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:37,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:37,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:37,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:37,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:37,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:37,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:37,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:37,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:37,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:37,356 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:37,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:37,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:37,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:37,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:37,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:37,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:37,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:37,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:37,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:37,359 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:37,359 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:37,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:37,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:37,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:37,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:37,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:37,449 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:37,449 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:37,450 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 13:00:37,522 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a43791e/08a6bb6248a849f1b1b2bfd4b67751a3/FLAGf33f79592 [2018-11-23 13:00:38,017 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:38,018 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/quick_sort_split_true-unreach-call.i [2018-11-23 13:00:38,033 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a43791e/08a6bb6248a849f1b1b2bfd4b67751a3/FLAGf33f79592 [2018-11-23 13:00:38,328 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a43791e/08a6bb6248a849f1b1b2bfd4b67751a3 [2018-11-23 13:00:38,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:38,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:38,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:38,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:38,344 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:38,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475dcdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:38, skipping insertion in model container [2018-11-23 13:00:38,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:38" (1/1) ... [2018-11-23 13:00:38,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:38,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:38,862 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:38,880 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:38,963 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:39,106 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:39,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39 WrapperNode [2018-11-23 13:00:39,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:39,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:39,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:39,108 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:39,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:39,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:39,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:39,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:39,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (1/1) ... [2018-11-23 13:00:39,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:39,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:39,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:39,191 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:39,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (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 13:00:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:39,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:39,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure create_list [2018-11-23 13:00:39,259 INFO L138 BoogieDeclarations]: Found implementation of procedure create_list [2018-11-23 13:00:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:00:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 13:00:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_list [2018-11-23 13:00:39,260 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_list [2018-11-23 13:00:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:39,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:40,125 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:40,126 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:00:40,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:40 BoogieIcfgContainer [2018-11-23 13:00:40,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:40,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:40,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:40,132 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:40,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:38" (1/3) ... [2018-11-23 13:00:40,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7973f55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:40, skipping insertion in model container [2018-11-23 13:00:40,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:39" (2/3) ... [2018-11-23 13:00:40,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7973f55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:40, skipping insertion in model container [2018-11-23 13:00:40,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:40" (3/3) ... [2018-11-23 13:00:40,136 INFO L112 eAbstractionObserver]: Analyzing ICFG quick_sort_split_true-unreach-call.i [2018-11-23 13:00:40,147 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:40,155 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 13:00:40,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 13:00:40,207 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:40,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:40,208 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:40,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:40,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:40,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:40,208 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:40,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:40,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 13:00:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:00:40,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:40,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:40,238 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:40,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:40,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1030563642, now seen corresponding path program 1 times [2018-11-23 13:00:40,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:40,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:40,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:40,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:40,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 13:00:40,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 13:00:40,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 13:00:40,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #98#return; {39#true} is VALID [2018-11-23 13:00:40,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret15 := main(); {39#true} is VALID [2018-11-23 13:00:40,449 INFO L256 TraceCheckUtils]: 5: Hoare triple {39#true} call #t~ret7.base, #t~ret7.offset := create_list(); {39#true} is VALID [2018-11-23 13:00:40,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {39#true} is VALID [2018-11-23 13:00:40,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 13:00:40,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#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; {40#false} is VALID [2018-11-23 13:00:40,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-23 13:00:40,451 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #102#return; {40#false} is VALID [2018-11-23 13:00:40,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#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 := 0, 0;~high~0.base, ~high~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {40#false} is VALID [2018-11-23 13:00:40,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 13:00:40,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~low~0.base != 0 || ~low~0.offset != 0);call #t~mem11 := read~int(~low~0.base, ~low~0.offset, 4); {40#false} is VALID [2018-11-23 13:00:40,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume !(-1 == #t~mem11);havoc #t~mem11; {40#false} is VALID [2018-11-23 13:00:40,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 13:00:40,457 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 13:00:40,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:40,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:40,465 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 13:00:40,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:40,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:40,577 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 13:00:40,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:40,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:40,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:40,590 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 13:00:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,009 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2018-11-23 13:00:41,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:41,010 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 13:00:41,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 13:00:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 13:00:41,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-23 13:00:41,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:41,316 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:00:41,316 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:00:41,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:00:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 13:00:41,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:41,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 13:00:41,365 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:00:41,365 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:00:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,372 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 13:00:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 13:00:41,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:41,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:41,373 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:00:41,373 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:00:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,379 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 13:00:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 13:00:41,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:41,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:41,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:41,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:00:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 13:00:41,386 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2018-11-23 13:00:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:41,386 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 13:00:41,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 13:00:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:00:41,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:41,388 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 13:00:41,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:41,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1022051762, now seen corresponding path program 1 times [2018-11-23 13:00:41,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:41,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:41,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:41,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2018-11-23 13:00:41,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {217#true} is VALID [2018-11-23 13:00:41,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {217#true} assume true; {217#true} is VALID [2018-11-23 13:00:41,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {217#true} {217#true} #98#return; {217#true} is VALID [2018-11-23 13:00:41,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {217#true} call #t~ret15 := main(); {217#true} is VALID [2018-11-23 13:00:41,580 INFO L256 TraceCheckUtils]: 5: Hoare triple {217#true} call #t~ret7.base, #t~ret7.offset := create_list(); {217#true} is VALID [2018-11-23 13:00:41,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {217#true} is VALID [2018-11-23 13:00:41,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {217#true} is VALID [2018-11-23 13:00:41,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {217#true} assume !(0 != #t~nondet4);havoc #t~nondet4; {217#true} is VALID [2018-11-23 13:00:41,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {217#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#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; {217#true} is VALID [2018-11-23 13:00:41,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#true} assume true; {217#true} is VALID [2018-11-23 13:00:41,582 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {217#true} {217#true} #102#return; {217#true} is VALID [2018-11-23 13:00:41,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#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 := 0, 0;~high~0.base, ~high~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {219#(and (= main_~low~0.offset 0) (= main_~low~0.base 0))} is VALID [2018-11-23 13:00:41,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {219#(and (= main_~low~0.offset 0) (= main_~low~0.base 0))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {219#(and (= main_~low~0.offset 0) (= main_~low~0.base 0))} is VALID [2018-11-23 13:00:41,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {219#(and (= main_~low~0.offset 0) (= main_~low~0.base 0))} assume !!(~low~0.base != 0 || ~low~0.offset != 0);call #t~mem11 := read~int(~low~0.base, ~low~0.offset, 4); {218#false} is VALID [2018-11-23 13:00:41,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {218#false} assume !(-1 == #t~mem11);havoc #t~mem11; {218#false} is VALID [2018-11-23 13:00:41,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {218#false} assume !false; {218#false} is VALID [2018-11-23 13:00:41,624 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 13:00:41,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:41,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:00:41,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 13:00:41,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:41,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:00:41,824 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 13:00:41,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:00:41,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:00:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:00:41,826 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2018-11-23 13:00:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,202 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-23 13:00:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:00:42,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 13:00:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 13:00:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 13:00:42,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 13:00:42,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:42,315 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:00:42,315 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:00:42,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:00:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:00:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:00:42,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:42,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:42,334 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:42,334 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,338 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:00:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:00:42,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,339 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:42,339 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,342 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:00:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:00:42,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:42,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:00:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 13:00:42,347 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2018-11-23 13:00:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:42,347 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 13:00:42,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:00:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:00:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:00:42,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:42,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:42,349 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:42,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1618876125, now seen corresponding path program 1 times [2018-11-23 13:00:42,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:42,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:42,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:42,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:42,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {364#true} is VALID [2018-11-23 13:00:42,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {364#true} is VALID [2018-11-23 13:00:42,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {364#true} assume true; {364#true} is VALID [2018-11-23 13:00:42,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {364#true} {364#true} #98#return; {364#true} is VALID [2018-11-23 13:00:42,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {364#true} call #t~ret15 := main(); {364#true} is VALID [2018-11-23 13:00:42,433 INFO L256 TraceCheckUtils]: 5: Hoare triple {364#true} call #t~ret7.base, #t~ret7.offset := create_list(); {364#true} is VALID [2018-11-23 13:00:42,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {364#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {364#true} is VALID [2018-11-23 13:00:42,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {364#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {364#true} is VALID [2018-11-23 13:00:42,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {364#true} assume !(0 != #t~nondet4);havoc #t~nondet4; {364#true} is VALID [2018-11-23 13:00:42,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {364#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4);#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; {364#true} is VALID [2018-11-23 13:00:42,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {364#true} assume true; {364#true} is VALID [2018-11-23 13:00:42,436 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {364#true} {364#true} #102#return; {364#true} is VALID [2018-11-23 13:00:42,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {364#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 := 0, 0;~high~0.base, ~high~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {366#(and (= main_~high~0.base 0) (= main_~high~0.offset 0))} is VALID [2018-11-23 13:00:42,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {366#(and (= main_~high~0.base 0) (= main_~high~0.offset 0))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {366#(and (= main_~high~0.base 0) (= main_~high~0.offset 0))} is VALID [2018-11-23 13:00:42,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {366#(and (= main_~high~0.base 0) (= main_~high~0.offset 0))} assume !(~low~0.base != 0 || ~low~0.offset != 0); {366#(and (= main_~high~0.base 0) (= main_~high~0.offset 0))} is VALID [2018-11-23 13:00:42,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {366#(and (= main_~high~0.base 0) (= main_~high~0.offset 0))} assume !!(~high~0.base != 0 || ~high~0.offset != 0);call #t~mem13 := read~int(~high~0.base, ~high~0.offset, 4); {365#false} is VALID [2018-11-23 13:00:42,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {365#false} assume !(1 == #t~mem13);havoc #t~mem13; {365#false} is VALID [2018-11-23 13:00:42,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {365#false} assume !false; {365#false} is VALID [2018-11-23 13:00:42,445 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 13:00:42,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:42,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:00:42,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 13:00:42,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:42,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:00:42,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:42,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:00:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:00:42,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:00:42,477 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 13:00:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,588 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:00:42,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:00:42,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 13:00:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:00:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:00:42,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 13:00:42,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:42,701 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:00:42,701 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:00:42,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:00:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:00:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:00:42,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:42,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:00:42,703 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:00:42,704 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:00:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,704 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:00:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:00:42,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,705 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:00:42,705 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:00:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,706 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:00:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:00:42,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:42,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:00:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:00:42,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-23 13:00:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:42,708 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:00:42,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:00:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:00:42,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:00:42,783 INFO L451 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: true [2018-11-23 13:00:42,783 INFO L451 ceAbstractionStarter]: At program point L576-1(lines 571 577) the Hoare annotation is: true [2018-11-23 13:00:42,783 INFO L451 ceAbstractionStarter]: At program point L574(line 574) the Hoare annotation is: true [2018-11-23 13:00:42,783 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 576) no Hoare annotation was computed. [2018-11-23 13:00:42,784 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 577) no Hoare annotation was computed. [2018-11-23 13:00:42,784 INFO L448 ceAbstractionStarter]: For program point L571-3(lines 571 577) no Hoare annotation was computed. [2018-11-23 13:00:42,784 INFO L448 ceAbstractionStarter]: For program point create_listEXIT(lines 569 579) no Hoare annotation was computed. [2018-11-23 13:00:42,784 INFO L451 ceAbstractionStarter]: At program point create_listENTRY(lines 569 579) the Hoare annotation is: true [2018-11-23 13:00:42,784 INFO L448 ceAbstractionStarter]: For program point create_listFINAL(lines 569 579) no Hoare annotation was computed. [2018-11-23 13:00:42,784 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:00:42,785 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:00:42,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:00:42,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:00:42,785 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:00:42,785 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:00:42,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:00:42,785 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 580 602) no Hoare annotation was computed. [2018-11-23 13:00:42,786 INFO L448 ceAbstractionStarter]: For program point L597-1(lines 580 602) no Hoare annotation was computed. [2018-11-23 13:00:42,786 INFO L448 ceAbstractionStarter]: For program point L597-2(lines 580 602) no Hoare annotation was computed. [2018-11-23 13:00:42,786 INFO L448 ceAbstractionStarter]: For program point L593(lines 593 594) no Hoare annotation was computed. [2018-11-23 13:00:42,786 INFO L448 ceAbstractionStarter]: For program point L593-2(lines 593 594) no Hoare annotation was computed. [2018-11-23 13:00:42,786 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2018-11-23 13:00:42,786 INFO L444 ceAbstractionStarter]: At program point L585-2(lines 585 591) the Hoare annotation is: (and (= main_~low~0.offset 0) (= main_~low~0.base 0) (= main_~high~0.base 0) (= main_~high~0.offset 0)) [2018-11-23 13:00:42,787 INFO L448 ceAbstractionStarter]: For program point L581(line 581) no Hoare annotation was computed. [2018-11-23 13:00:42,787 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 599) no Hoare annotation was computed. [2018-11-23 13:00:42,787 INFO L448 ceAbstractionStarter]: For program point L598-2(lines 598 599) no Hoare annotation was computed. [2018-11-23 13:00:42,787 INFO L448 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-11-23 13:00:42,787 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-23 13:00:42,787 INFO L448 ceAbstractionStarter]: For program point L586-2(line 586) no Hoare annotation was computed. [2018-11-23 13:00:42,787 INFO L448 ceAbstractionStarter]: For program point L599(line 599) no Hoare annotation was computed. [2018-11-23 13:00:42,787 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 594) no Hoare annotation was computed. [2018-11-23 13:00:42,787 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 580 602) the Hoare annotation is: true [2018-11-23 13:00:42,788 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 580 602) no Hoare annotation was computed. [2018-11-23 13:00:42,788 INFO L448 ceAbstractionStarter]: For program point append_to_listEXIT(lines 562 568) no Hoare annotation was computed. [2018-11-23 13:00:42,788 INFO L451 ceAbstractionStarter]: At program point append_to_listENTRY(lines 562 568) the Hoare annotation is: true [2018-11-23 13:00:42,788 INFO L448 ceAbstractionStarter]: For program point append_to_listFINAL(lines 562 568) no Hoare annotation was computed. [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: L571-3 has no Hoare annotation [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-23 13:00:42,790 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: L571-3 has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 13:00:42,791 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: create_listFINAL has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: L592-1 has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 13:00:42,792 WARN L170 areAnnotationChecker]: create_listEXIT has no Hoare annotation [2018-11-23 13:00:42,793 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-23 13:00:42,793 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-23 13:00:42,793 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-23 13:00:42,793 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-23 13:00:42,793 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-23 13:00:42,793 WARN L170 areAnnotationChecker]: L586-2 has no Hoare annotation [2018-11-23 13:00:42,793 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2018-11-23 13:00:42,793 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-23 13:00:42,794 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-23 13:00:42,794 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-23 13:00:42,794 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-23 13:00:42,794 WARN L170 areAnnotationChecker]: L593-2 has no Hoare annotation [2018-11-23 13:00:42,794 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:00:42,794 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-23 13:00:42,794 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-23 13:00:42,794 WARN L170 areAnnotationChecker]: L598-2 has no Hoare annotation [2018-11-23 13:00:42,794 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 13:00:42,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:00:42 BoogieIcfgContainer [2018-11-23 13:00:42,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:00:42,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:00:42,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:00:42,806 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:00:42,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:40" (3/4) ... [2018-11-23 13:00:42,810 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:00:42,818 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure create_list [2018-11-23 13:00:42,818 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:00:42,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:00:42,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure append_to_list [2018-11-23 13:00:42,824 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 13:00:42,824 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:00:42,825 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:00:42,886 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/heap-data/quick_sort_split_true-unreach-call.i-witness.graphml [2018-11-23 13:00:42,886 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:00:42,888 INFO L168 Benchmark]: Toolchain (without parser) took 4549.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -591.1 MB). Peak memory consumption was 126.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:42,890 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:42,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.7 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:42,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.08 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:42,892 INFO L168 Benchmark]: Boogie Preprocessor took 42.55 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:42,892 INFO L168 Benchmark]: RCFGBuilder took 936.41 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:42,893 INFO L168 Benchmark]: TraceAbstraction took 2676.76 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:42,893 INFO L168 Benchmark]: Witness Printer took 81.21 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:42,898 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.7 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.08 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.55 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 936.41 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2676.76 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. * Witness Printer took 81.21 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. 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: ((low == 0 && low == 0) && high == 0) && high == 0 - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 2 error locations. SAFE Result, 2.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 SDtfs, 14 SDslu, 42 SDs, 0 SdLazy, 3 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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.0s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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...