./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/rule57_ebda_blast_true-termination.c_true-unreach-call_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-regression/rule57_ebda_blast_true-termination.c_true-unreach-call_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46e22e1d53e7e827d6bbfb0cb2148ba6e47285c6 .............................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:32:53,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:32:53,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:32:53,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:32:53,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:32:53,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:32:53,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:32:53,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:32:53,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:32:53,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:32:53,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:32:53,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:32:53,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:32:53,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:32:53,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:32:53,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:32:53,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:32:53,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:32:53,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:32:53,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:32:53,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:32:53,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:32:53,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:32:53,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:32:53,390 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:32:53,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:32:53,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:32:53,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:32:53,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:32:53,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:32:53,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:32:53,396 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:32:53,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:32:53,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:32:53,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:32:53,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:32:53,399 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:32:53,416 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:32:53,416 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:32:53,417 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:32:53,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:32:53,418 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:32:53,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:32:53,418 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:32:53,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:32:53,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:32:53,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:32:53,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:32:53,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:32:53,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:32:53,420 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:32:53,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:32:53,420 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:32:53,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:32:53,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:32:53,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:32:53,421 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:32:53,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:32:53,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:32:53,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:32:53,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:32:53,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:32:53,422 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:32:53,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:32:53,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:32:53,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46e22e1d53e7e827d6bbfb0cb2148ba6e47285c6 [2019-01-12 09:32:53,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:32:53,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:32:53,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:32:53,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:32:53,510 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:32:53,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/rule57_ebda_blast_true-termination.c_true-unreach-call_1.i [2019-01-12 09:32:53,573 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a190299f9/f7c9f4aeb0e649c685da04f5042e5d09/FLAG09a36772b [2019-01-12 09:32:54,054 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:32:54,055 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/rule57_ebda_blast_true-termination.c_true-unreach-call_1.i [2019-01-12 09:32:54,064 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a190299f9/f7c9f4aeb0e649c685da04f5042e5d09/FLAG09a36772b [2019-01-12 09:32:54,383 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a190299f9/f7c9f4aeb0e649c685da04f5042e5d09 [2019-01-12 09:32:54,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:32:54,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:32:54,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:32:54,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:32:54,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:32:54,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267dc0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54, skipping insertion in model container [2019-01-12 09:32:54,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:32:54,430 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:32:54,642 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:32:54,669 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:32:54,696 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:32:54,718 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:32:54,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54 WrapperNode [2019-01-12 09:32:54,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:32:54,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:32:54,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:32:54,721 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:32:54,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:32:54,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:32:54,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:32:54,766 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:32:54,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (1/1) ... [2019-01-12 09:32:54,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:32:54,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:32:54,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:32:54,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:32:54,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (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 [2019-01-12 09:32:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:32:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:32:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:32:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 09:32:54,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:32:54,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:32:55,420 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:32:55,420 INFO L286 CfgBuilder]: Removed 26 assue(true) statements. [2019-01-12 09:32:55,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:55 BoogieIcfgContainer [2019-01-12 09:32:55,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:32:55,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:32:55,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:32:55,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:32:55,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:32:54" (1/3) ... [2019-01-12 09:32:55,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8afa4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:32:55, skipping insertion in model container [2019-01-12 09:32:55,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:54" (2/3) ... [2019-01-12 09:32:55,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8afa4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:32:55, skipping insertion in model container [2019-01-12 09:32:55,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:55" (3/3) ... [2019-01-12 09:32:55,429 INFO L112 eAbstractionObserver]: Analyzing ICFG rule57_ebda_blast_true-termination.c_true-unreach-call_1.i [2019-01-12 09:32:55,439 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:32:55,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:32:55,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:32:55,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:32:55,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:32:55,490 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:32:55,490 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:32:55,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:32:55,491 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:32:55,491 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:32:55,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:32:55,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:32:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 09:32:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:32:55,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:55,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:55,515 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1391500388, now seen corresponding path program 1 times [2019-01-12 09:32:55,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:55,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:55,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:55,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:55,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:32:55,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:32:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:32:55,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:32:55,731 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-01-12 09:32:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:56,022 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-01-12 09:32:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:32:56,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 09:32:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:56,036 INFO L225 Difference]: With dead ends: 37 [2019-01-12 09:32:56,037 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:32:56,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:32:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:32:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 09:32:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:32:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-01-12 09:32:56,081 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 10 [2019-01-12 09:32:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:56,081 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-01-12 09:32:56,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:32:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-01-12 09:32:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:32:56,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:56,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:56,083 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:56,083 INFO L82 PathProgramCache]: Analyzing trace with hash -545430346, now seen corresponding path program 1 times [2019-01-12 09:32:56,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:56,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:56,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:56,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:56,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:56,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:32:56,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:32:56,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:32:56,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:32:56,405 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2019-01-12 09:32:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:56,638 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-12 09:32:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:32:56,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-12 09:32:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:56,643 INFO L225 Difference]: With dead ends: 31 [2019-01-12 09:32:56,643 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:32:56,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:32:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:32:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 09:32:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:32:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-01-12 09:32:56,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2019-01-12 09:32:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:56,653 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-12 09:32:56,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:32:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-01-12 09:32:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:32:56,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:56,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:56,656 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:56,657 INFO L82 PathProgramCache]: Analyzing trace with hash 116488903, now seen corresponding path program 1 times [2019-01-12 09:32:56,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:56,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:56,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:56,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:56,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:56,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:56,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:32:56,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:32:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:32:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:32:56,743 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2019-01-12 09:32:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:56,787 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-01-12 09:32:56,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:32:56,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 09:32:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:56,788 INFO L225 Difference]: With dead ends: 34 [2019-01-12 09:32:56,788 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 09:32:56,789 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 [2019-01-12 09:32:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 09:32:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-12 09:32:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-12 09:32:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-12 09:32:56,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-12 09:32:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:56,797 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-12 09:32:56,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:32:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-12 09:32:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:32:56,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:56,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:56,799 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:56,800 INFO L82 PathProgramCache]: Analyzing trace with hash -733347331, now seen corresponding path program 1 times [2019-01-12 09:32:56,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:56,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:56,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:56,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:56,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:56,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:32:56,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:32:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:32:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:32:56,906 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 3 states. [2019-01-12 09:32:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:56,922 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-01-12 09:32:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:32:56,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-12 09:32:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:56,924 INFO L225 Difference]: With dead ends: 22 [2019-01-12 09:32:56,924 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:32:56,925 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 [2019-01-12 09:32:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:32:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:32:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:32:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:32:56,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-01-12 09:32:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:56,927 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:32:56,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:32:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:32:56,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:32:56,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:32:57,131 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 09:32:57,343 INFO L444 ceAbstractionStarter]: At program point L56(lines 55 57) the Hoare annotation is: (and (not (= |ULTIMATE.start_kzalloc_#res.base| 0)) (not (= ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0.base 0)) (not (= |ULTIMATE.start_kzalloc_#t~malloc0.base| 0)) (not (= ~tmp_slot~0.base 0))) [2019-01-12 09:32:57,343 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 51) no Hoare annotation was computed. [2019-01-12 09:32:57,343 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 48 51) no Hoare annotation was computed. [2019-01-12 09:32:57,344 INFO L444 ceAbstractionStarter]: At program point L131(lines 71 132) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_kzalloc_#res.base| 0))) (.cse1 (not (= ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0.base 0))) (.cse2 (not (= |ULTIMATE.start_kzalloc_#t~malloc0.base| 0))) (.cse3 (not (= ~tmp_slot~0.base 0)))) (or (and .cse0 .cse1 (= ~freed_tmp_slot~0 1) .cse2 .cse3) (and .cse0 .cse1 (= ~used_tmp_slot~0 1) .cse2 .cse3))) [2019-01-12 09:32:57,344 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 106) no Hoare annotation was computed. [2019-01-12 09:32:57,344 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:32:57,345 INFO L444 ceAbstractionStarter]: At program point L127(lines 71 132) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_kzalloc_#res.base| 0))) (.cse1 (not (= ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0.base 0))) (.cse2 (not (= |ULTIMATE.start_kzalloc_#t~malloc0.base| 0))) (.cse3 (not (= ~tmp_slot~0.base 0)))) (or (and .cse0 .cse1 (= ~freed_tmp_slot~0 1) .cse2 .cse3) (and .cse0 .cse1 (= ~used_tmp_slot~0 1) .cse2 .cse3))) [2019-01-12 09:32:57,345 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-01-12 09:32:57,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:32:57,345 INFO L448 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-01-12 09:32:57,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:32:57,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-01-12 09:32:57,345 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 89) no Hoare annotation was computed. [2019-01-12 09:32:57,348 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 50) no Hoare annotation was computed. [2019-01-12 09:32:57,348 INFO L448 ceAbstractionStarter]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2019-01-12 09:32:57,348 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 81) no Hoare annotation was computed. [2019-01-12 09:32:57,348 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 137) no Hoare annotation was computed. [2019-01-12 09:32:57,349 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:32:57,349 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 121) no Hoare annotation was computed. [2019-01-12 09:32:57,349 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 117) no Hoare annotation was computed. [2019-01-12 09:32:57,349 INFO L444 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (and (not (= |ULTIMATE.start_kzalloc_#res.base| 0)) (= ~freed_tmp_slot~0 1) (not (= |ULTIMATE.start_kzalloc_#t~malloc0.base| 0))) [2019-01-12 09:32:57,350 INFO L444 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (and (not (= |ULTIMATE.start_kzalloc_#res.base| 0)) (not (= ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0.base 0)) (= ~freed_tmp_slot~0 1) (not (= |ULTIMATE.start_kzalloc_#t~malloc0.base| 0))) [2019-01-12 09:32:57,351 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-01-12 09:32:57,351 INFO L444 ceAbstractionStarter]: At program point L63(lines 61 64) the Hoare annotation is: (and (not (= |ULTIMATE.start_kzalloc_#res.base| 0)) (not (= ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0.base 0)) (= ~used_tmp_slot~0 1) (not (= |ULTIMATE.start_kzalloc_#t~malloc0.base| 0)) (not (= ~tmp_slot~0.base 0))) [2019-01-12 09:32:57,351 INFO L444 ceAbstractionStarter]: At program point L121(lines 71 132) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_kzalloc_#res.base| 0))) (.cse1 (not (= ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0.base 0))) (.cse2 (not (= |ULTIMATE.start_kzalloc_#t~malloc0.base| 0))) (.cse3 (not (= ~tmp_slot~0.base 0)))) (or (and .cse0 .cse1 (= ~freed_tmp_slot~0 1) .cse2 .cse3) (and .cse0 .cse1 (= ~used_tmp_slot~0 1) .cse2 .cse3))) [2019-01-12 09:32:57,352 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-01-12 09:32:57,353 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 138) no Hoare annotation was computed. [2019-01-12 09:32:57,353 INFO L444 ceAbstractionStarter]: At program point L68(lines 66 69) the Hoare annotation is: (and (not (= |ULTIMATE.start_kzalloc_#res.base| 0)) (not (= ULTIMATE.start_ebda_rsrc_controller_~hp_slot_ptr~0.base 0)) (= ~used_tmp_slot~0 1) (not (= |ULTIMATE.start_kzalloc_#t~malloc0.base| 0)) (not (= ~tmp_slot~0.base 0))) [2019-01-12 09:32:57,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:32:57 BoogieIcfgContainer [2019-01-12 09:32:57,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:32:57,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:32:57,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:32:57,377 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:32:57,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:55" (3/4) ... [2019-01-12 09:32:57,382 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:32:57,399 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-01-12 09:32:57,399 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 09:32:57,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\result == 0) && freed_tmp_slot == 1) && !(calloc(1, size) == 0) [2019-01-12 09:32:57,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && !(hp_slot_ptr == 0)) && freed_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) || ((((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) [2019-01-12 09:32:57,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && !(hp_slot_ptr == 0)) && freed_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) || ((((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) [2019-01-12 09:32:57,426 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\result == 0) && !(hp_slot_ptr == 0)) && freed_tmp_slot == 1) && !(calloc(1, size) == 0) [2019-01-12 09:32:57,426 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\result == 0) && !(hp_slot_ptr == 0)) && !(calloc(1, size) == 0)) && !(tmp_slot == 0) [2019-01-12 09:32:57,426 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && !(hp_slot_ptr == 0)) && freed_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) || ((((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) [2019-01-12 09:32:57,427 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0) [2019-01-12 09:32:57,427 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0) [2019-01-12 09:32:57,469 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:32:57,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:32:57,470 INFO L168 Benchmark]: Toolchain (without parser) took 3083.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 954.0 MB in the beginning and 1.0 GB in the end (delta: -76.6 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:57,471 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:32:57,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.39 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:57,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.49 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 937.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:57,482 INFO L168 Benchmark]: Boogie Preprocessor took 109.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:57,483 INFO L168 Benchmark]: RCFGBuilder took 545.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:57,483 INFO L168 Benchmark]: TraceAbstraction took 1953.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:57,488 INFO L168 Benchmark]: Witness Printer took 92.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:57,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.39 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.49 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 937.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 545.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1953.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. * Witness Printer took 92.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && !(hp_slot_ptr == 0)) && freed_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) || ((((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: (((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((!(\result == 0) && !(hp_slot_ptr == 0)) && freed_tmp_slot == 1) && !(calloc(1, size) == 0) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((!(\result == 0) && !(hp_slot_ptr == 0)) && !(calloc(1, size) == 0)) && !(tmp_slot == 0) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && !(hp_slot_ptr == 0)) && freed_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) || ((((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (!(\result == 0) && freed_tmp_slot == 1) && !(calloc(1, size) == 0) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && !(hp_slot_ptr == 0)) && freed_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) || ((((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0)) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((!(\result == 0) && !(hp_slot_ptr == 0)) && used_tmp_slot == 1) && !(calloc(1, size) == 0)) && !(tmp_slot == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. SAFE Result, 1.8s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 93 SDtfs, 176 SDslu, 29 SDs, 0 SdLazy, 33 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 13 NumberOfFragments, 208 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 1458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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...