./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 99f06babb1e84af30f1e79717563b6d2ea291b36 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 20:47:29,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:47:29,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:47:29,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:47:29,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:47:29,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:47:29,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:47:29,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:47:29,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:47:29,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:47:29,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:47:29,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:47:29,316 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:47:29,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:47:29,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:47:29,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:47:29,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:47:29,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:47:29,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:47:29,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:47:29,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:47:29,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:47:29,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:47:29,348 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:47:29,348 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:47:29,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:47:29,355 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:47:29,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:47:29,357 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:47:29,359 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:47:29,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:47:29,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:47:29,360 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:47:29,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:47:29,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:47:29,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:47:29,362 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-28 20:47:29,386 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:47:29,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:47:29,388 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:47:29,389 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:47:29,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:47:29,389 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:47:29,390 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:47:29,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:47:29,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:47:29,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:47:29,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:47:29,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:47:29,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:47:29,393 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:47:29,394 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:47:29,394 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:47:29,394 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:47:29,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:47:29,396 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:47:29,396 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:47:29,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:47:29,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:47:29,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:47:29,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:47:29,397 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:47:29,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:47:29,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:47:29,399 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-28 20:47:29,400 INFO L133 SettingsManager]: * To the following directory=dump/ 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99f06babb1e84af30f1e79717563b6d2ea291b36 [2018-11-28 20:47:29,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:47:29,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:47:29,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:47:29,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:47:29,481 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:47:29,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i [2018-11-28 20:47:29,554 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0090ae3/cfeafebf455c4bd1b16b60ea690a67a6/FLAG6ff5b19a3 [2018-11-28 20:47:30,252 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:47:30,253 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i [2018-11-28 20:47:30,308 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0090ae3/cfeafebf455c4bd1b16b60ea690a67a6/FLAG6ff5b19a3 [2018-11-28 20:47:30,331 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0090ae3/cfeafebf455c4bd1b16b60ea690a67a6 [2018-11-28 20:47:30,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:47:30,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:47:30,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:47:30,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:47:30,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:47:30,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:47:30" (1/1) ... [2018-11-28 20:47:30,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60349036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:30, skipping insertion in model container [2018-11-28 20:47:30,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:47:30" (1/1) ... [2018-11-28 20:47:30,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:47:30,479 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:47:31,339 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:47:31,544 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:47:31,736 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:47:31,776 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:47:31,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31 WrapperNode [2018-11-28 20:47:31,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:47:31,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:47:31,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:47:31,778 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:47:31,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:47:31,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:47:31,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:47:31,844 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:47:31,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (1/1) ... [2018-11-28 20:47:31,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:47:31,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:47:31,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:47:31,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:47:31,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (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-28 20:47:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 20:47:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 20:47:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 20:47:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-28 20:47:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-28 20:47:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-11-28 20:47:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-11-28 20:47:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_int [2018-11-28 20:47:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_int [2018-11-28 20:47:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-28 20:47:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-28 20:47:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:47:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-28 20:47:31,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-28 20:47:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-11-28 20:47:31,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-11-28 20:47:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-28 20:47:31,990 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-28 20:47:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 20:47:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 20:47:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-28 20:47:31,990 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-28 20:47:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 20:47:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 20:47:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-28 20:47:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-28 20:47:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_1 [2018-11-28 20:47:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_1 [2018-11-28 20:47:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-11-28 20:47:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-11-28 20:47:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:47:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:47:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-28 20:47:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-28 20:47:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-28 20:47:31,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-28 20:47:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_2 [2018-11-28 20:47:31,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_2 [2018-11-28 20:47:32,282 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 20:47:32,283 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 20:47:32,852 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:47:32,852 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 20:47:32,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:47:32 BoogieIcfgContainer [2018-11-28 20:47:32,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:47:32,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:47:32,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:47:32,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:47:32,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:47:30" (1/3) ... [2018-11-28 20:47:32,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d0b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:47:32, skipping insertion in model container [2018-11-28 20:47:32,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:31" (2/3) ... [2018-11-28 20:47:32,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d0b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:47:32, skipping insertion in model container [2018-11-28 20:47:32,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:47:32" (3/3) ... [2018-11-28 20:47:32,861 INFO L112 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i [2018-11-28 20:47:32,872 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:47:32,882 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 20:47:32,900 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 20:47:32,931 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:47:32,932 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:47:32,932 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:47:32,932 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:47:32,932 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:47:32,932 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:47:32,933 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:47:32,933 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:47:32,933 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:47:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-11-28 20:47:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 20:47:32,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:32,961 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, 1, 1, 1, 1] [2018-11-28 20:47:32,963 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:32,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2061776394, now seen corresponding path program 1 times [2018-11-28 20:47:32,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:32,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:33,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:33,327 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-28 20:47:33,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:47:33,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:47:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:47:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:47:33,357 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2018-11-28 20:47:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:33,549 INFO L93 Difference]: Finished difference Result 223 states and 274 transitions. [2018-11-28 20:47:33,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:47:33,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 20:47:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:33,567 INFO L225 Difference]: With dead ends: 223 [2018-11-28 20:47:33,567 INFO L226 Difference]: Without dead ends: 135 [2018-11-28 20:47:33,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-28 20:47:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-28 20:47:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-11-28 20:47:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-28 20:47:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-11-28 20:47:33,642 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 24 [2018-11-28 20:47:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:33,643 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-11-28 20:47:33,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:47:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-11-28 20:47:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:47:33,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:33,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:47:33,648 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:33,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash -698380565, now seen corresponding path program 1 times [2018-11-28 20:47:33,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:33,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:33,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:33,920 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-28 20:47:33,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:33,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:47:33,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:47:33,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:47:33,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:47:33,927 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 7 states. [2018-11-28 20:47:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:34,067 INFO L93 Difference]: Finished difference Result 241 states and 288 transitions. [2018-11-28 20:47:34,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:47:34,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-28 20:47:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:34,074 INFO L225 Difference]: With dead ends: 241 [2018-11-28 20:47:34,074 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 20:47:34,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:47:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 20:47:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-11-28 20:47:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-28 20:47:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-11-28 20:47:34,096 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 56 [2018-11-28 20:47:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:34,096 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-11-28 20:47:34,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:47:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-11-28 20:47:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 20:47:34,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:34,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:47:34,100 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:34,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1775691705, now seen corresponding path program 1 times [2018-11-28 20:47:34,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:34,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:34,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:34,494 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-28 20:47:34,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:34,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:47:34,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:47:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:47:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:47:34,496 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 7 states. [2018-11-28 20:47:35,515 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-28 20:47:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:35,923 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2018-11-28 20:47:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:47:35,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-11-28 20:47:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:35,929 INFO L225 Difference]: With dead ends: 210 [2018-11-28 20:47:35,929 INFO L226 Difference]: Without dead ends: 207 [2018-11-28 20:47:35,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:47:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-28 20:47:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2018-11-28 20:47:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-28 20:47:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2018-11-28 20:47:35,962 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 62 [2018-11-28 20:47:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:35,962 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2018-11-28 20:47:35,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:47:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2018-11-28 20:47:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:47:35,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:35,969 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:47:35,969 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:35,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 648212136, now seen corresponding path program 1 times [2018-11-28 20:47:35,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:35,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:35,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:35,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:35,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:47:36,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:36,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:47:36,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:47:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:47:36,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:47:36,178 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand 7 states. [2018-11-28 20:47:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:36,330 INFO L93 Difference]: Finished difference Result 330 states and 390 transitions. [2018-11-28 20:47:36,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:47:36,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-11-28 20:47:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:36,337 INFO L225 Difference]: With dead ends: 330 [2018-11-28 20:47:36,337 INFO L226 Difference]: Without dead ends: 193 [2018-11-28 20:47:36,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:47:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-28 20:47:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2018-11-28 20:47:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-28 20:47:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2018-11-28 20:47:36,388 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 66 [2018-11-28 20:47:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:36,388 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2018-11-28 20:47:36,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:47:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2018-11-28 20:47:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 20:47:36,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:36,397 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:47:36,398 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:36,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:36,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1920379961, now seen corresponding path program 1 times [2018-11-28 20:47:36,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:36,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:36,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:36,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:36,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:47:36,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:36,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:47:36,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:47:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:47:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:47:36,782 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand 5 states. [2018-11-28 20:47:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:36,960 INFO L93 Difference]: Finished difference Result 375 states and 450 transitions. [2018-11-28 20:47:36,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:47:36,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-28 20:47:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:36,964 INFO L225 Difference]: With dead ends: 375 [2018-11-28 20:47:36,964 INFO L226 Difference]: Without dead ends: 205 [2018-11-28 20:47:36,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:47:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-28 20:47:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2018-11-28 20:47:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-28 20:47:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2018-11-28 20:47:36,988 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 81 [2018-11-28 20:47:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:36,988 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2018-11-28 20:47:36,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:47:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2018-11-28 20:47:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 20:47:36,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:36,991 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:47:36,992 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:36,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1476479287, now seen corresponding path program 1 times [2018-11-28 20:47:36,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:36,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:36,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:47:38,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:38,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 20:47:38,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 20:47:38,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 20:47:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:47:38,069 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand 14 states. [2018-11-28 20:47:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:39,887 INFO L93 Difference]: Finished difference Result 317 states and 360 transitions. [2018-11-28 20:47:39,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 20:47:39,895 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-28 20:47:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:39,897 INFO L225 Difference]: With dead ends: 317 [2018-11-28 20:47:39,897 INFO L226 Difference]: Without dead ends: 168 [2018-11-28 20:47:39,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:47:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-28 20:47:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2018-11-28 20:47:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-28 20:47:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2018-11-28 20:47:39,913 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 81 [2018-11-28 20:47:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:39,913 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2018-11-28 20:47:39,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 20:47:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2018-11-28 20:47:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:47:39,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:39,916 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:47:39,916 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:39,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash 676892673, now seen corresponding path program 1 times [2018-11-28 20:47:39,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:39,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:39,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:39,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:40,356 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-28 20:47:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 20:47:40,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:40,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:47:40,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:47:40,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:47:40,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:47:40,647 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 9 states. [2018-11-28 20:47:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:41,014 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2018-11-28 20:47:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:47:41,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-11-28 20:47:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:41,019 INFO L225 Difference]: With dead ends: 150 [2018-11-28 20:47:41,020 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 20:47:41,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:47:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 20:47:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-28 20:47:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-28 20:47:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-11-28 20:47:41,034 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 83 [2018-11-28 20:47:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:41,035 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-11-28 20:47:41,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:47:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-11-28 20:47:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-28 20:47:41,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:41,039 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:47:41,039 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:41,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1011867122, now seen corresponding path program 1 times [2018-11-28 20:47:41,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:41,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:41,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 20:47:41,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:41,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:47:41,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:47:41,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:47:41,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:47:41,535 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 6 states. [2018-11-28 20:47:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:41,947 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-11-28 20:47:41,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:47:41,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-28 20:47:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:41,950 INFO L225 Difference]: With dead ends: 138 [2018-11-28 20:47:41,950 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 20:47:41,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:47:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 20:47:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 20:47:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 20:47:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 20:47:41,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-11-28 20:47:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:41,954 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 20:47:41,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:47:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 20:47:41,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 20:47:41,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 20:47:42,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:47:42,591 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-11-28 20:47:42,659 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4922 4980) no Hoare annotation was computed. [2018-11-28 20:47:42,660 INFO L448 ceAbstractionStarter]: For program point L4945(lines 4945 4959) no Hoare annotation was computed. [2018-11-28 20:47:42,660 INFO L448 ceAbstractionStarter]: For program point L4976(line 4976) no Hoare annotation was computed. [2018-11-28 20:47:42,660 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4922 4980) no Hoare annotation was computed. [2018-11-28 20:47:42,660 INFO L444 ceAbstractionStarter]: At program point L4972(lines 4930 4979) the Hoare annotation is: (or (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-28 20:47:42,660 INFO L444 ceAbstractionStarter]: At program point L4966(lines 4930 4979) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,660 INFO L444 ceAbstractionStarter]: At program point L4968(lines 4930 4979) the Hoare annotation is: (or (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-28 20:47:42,661 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 4949 4958) no Hoare annotation was computed. [2018-11-28 20:47:42,661 INFO L444 ceAbstractionStarter]: At program point L4933(line 4933) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,661 INFO L444 ceAbstractionStarter]: At program point L4933-1(line 4933) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,661 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 4949 4958) no Hoare annotation was computed. [2018-11-28 20:47:42,661 INFO L444 ceAbstractionStarter]: At program point L4960(lines 4930 4979) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,661 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 4922 4980) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,661 INFO L448 ceAbstractionStarter]: For program point L4952(line 4952) no Hoare annotation was computed. [2018-11-28 20:47:42,662 INFO L444 ceAbstractionStarter]: At program point L4946(lines 4945 4959) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,663 INFO L448 ceAbstractionStarter]: For program point L4934(line 4934) no Hoare annotation was computed. [2018-11-28 20:47:42,663 INFO L448 ceAbstractionStarter]: For program point L4936(lines 4936 4939) no Hoare annotation was computed. [2018-11-28 20:47:42,664 INFO L448 ceAbstractionStarter]: For program point L4965(lines 4965 4969) no Hoare annotation was computed. [2018-11-28 20:47:42,664 INFO L448 ceAbstractionStarter]: For program point L5006(lines 5006 5011) no Hoare annotation was computed. [2018-11-28 20:47:42,664 INFO L444 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 4999 5016) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,664 INFO L448 ceAbstractionStarter]: For program point L5004-1(line 5004) no Hoare annotation was computed. [2018-11-28 20:47:42,664 INFO L448 ceAbstractionStarter]: For program point L5002(lines 5002 5013) no Hoare annotation was computed. [2018-11-28 20:47:42,664 INFO L444 ceAbstractionStarter]: At program point L5004(line 5004) the Hoare annotation is: (or (and (<= (+ |ldv_try_module_get_#in~module.base| |ldv_try_module_get_#in~module.offset|) (+ (* 18446744073709551616 (div (+ |ldv_try_module_get_#in~module.base| (+ |ldv_try_module_get_#in~module.offset| (- 1))) 18446744073709551616)) 18446744073709551615)) (= 1 ~ldv_module_refcounter~0) (= ldv_try_module_get_~module.base |ldv_try_module_get_#in~module.base|) (= ldv_try_module_get_~module.offset |ldv_try_module_get_#in~module.offset|)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-28 20:47:42,664 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 4999 5016) no Hoare annotation was computed. [2018-11-28 20:47:42,664 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 4999 5016) no Hoare annotation was computed. [2018-11-28 20:47:42,665 INFO L448 ceAbstractionStarter]: For program point pppox_initFINAL(lines 4900 4908) no Hoare annotation was computed. [2018-11-28 20:47:42,665 INFO L448 ceAbstractionStarter]: For program point L4904-1(line 4904) no Hoare annotation was computed. [2018-11-28 20:47:42,665 INFO L451 ceAbstractionStarter]: At program point pppox_initENTRY(lines 4900 4908) the Hoare annotation is: true [2018-11-28 20:47:42,665 INFO L451 ceAbstractionStarter]: At program point L4904(line 4904) the Hoare annotation is: true [2018-11-28 20:47:42,665 INFO L448 ceAbstractionStarter]: For program point pppox_initEXIT(lines 4900 4908) no Hoare annotation was computed. [2018-11-28 20:47:42,665 INFO L451 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 5110 5112) the Hoare annotation is: true [2018-11-28 20:47:42,665 INFO L448 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 5110 5112) no Hoare annotation was computed. [2018-11-28 20:47:42,665 INFO L448 ceAbstractionStarter]: For program point sock_unregisterFINAL(lines 5110 5112) no Hoare annotation was computed. [2018-11-28 20:47:42,666 INFO L451 ceAbstractionStarter]: At program point ldv_undefined_intENTRY(lines 5087 5089) the Hoare annotation is: true [2018-11-28 20:47:42,666 INFO L448 ceAbstractionStarter]: For program point ldv_undefined_intEXIT(lines 5087 5089) no Hoare annotation was computed. [2018-11-28 20:47:42,666 INFO L448 ceAbstractionStarter]: For program point ldv_undefined_intFINAL(lines 5087 5089) no Hoare annotation was computed. [2018-11-28 20:47:42,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 20:47:42,666 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) [2018-11-28 20:47:42,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 20:47:42,666 INFO L444 ceAbstractionStarter]: At program point L4895(lines 4864 4897) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,667 INFO L444 ceAbstractionStarter]: At program point L4893(line 4893) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (= 1 pppox_create_~tmp~2) (<= (+ |pppox_create_#t~mem45.base| |pppox_create_#t~mem45.offset|) (+ (* 18446744073709551616 (div (+ |pppox_create_#t~mem45.base| (+ |pppox_create_#t~mem45.offset| (- 1))) 18446744073709551616)) 18446744073709551615)) (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (let ((.cse4 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 18446744073709551616 (div (+ .cse1 (+ .cse0 (- 1))) 18446744073709551616)) 18446744073709551615))))))) [2018-11-28 20:47:42,667 INFO L448 ceAbstractionStarter]: For program point L4893-1(line 4893) no Hoare annotation was computed. [2018-11-28 20:47:42,667 INFO L448 ceAbstractionStarter]: For program point pppox_createFINAL(lines 4861 4898) no Hoare annotation was computed. [2018-11-28 20:47:42,667 INFO L448 ceAbstractionStarter]: For program point L4869(lines 4869 4872) no Hoare annotation was computed. [2018-11-28 20:47:42,667 INFO L448 ceAbstractionStarter]: For program point L4892-1(line 4892) no Hoare annotation was computed. [2018-11-28 20:47:42,667 INFO L444 ceAbstractionStarter]: At program point pppox_createENTRY(lines 4861 4898) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,667 INFO L444 ceAbstractionStarter]: At program point L4892(line 4892) the Hoare annotation is: (or (and (= 1 pppox_create_~tmp~2) (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (let ((.cse4 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 18446744073709551616 (div (+ .cse1 (+ .cse0 (- 1))) 18446744073709551616)) 18446744073709551615)))))) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-28 20:47:42,668 INFO L448 ceAbstractionStarter]: For program point L4886(lines 4886 4889) no Hoare annotation was computed. [2018-11-28 20:47:42,668 INFO L448 ceAbstractionStarter]: For program point L4884-1(line 4884) no Hoare annotation was computed. [2018-11-28 20:47:42,668 INFO L444 ceAbstractionStarter]: At program point L4884(line 4884) the Hoare annotation is: (or (let ((.cse2 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (and (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) |pppox_create_#t~mem35.base|) (= 1 ~ldv_module_refcounter~0) (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) |pppox_create_#t~mem35.offset|)))) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-28 20:47:42,668 INFO L448 ceAbstractionStarter]: For program point L4880(lines 4880 4890) no Hoare annotation was computed. [2018-11-28 20:47:42,668 INFO L448 ceAbstractionStarter]: For program point L4874(lines 4874 4879) no Hoare annotation was computed. [2018-11-28 20:47:42,668 INFO L448 ceAbstractionStarter]: For program point pppox_createEXIT(lines 4861 4898) no Hoare annotation was computed. [2018-11-28 20:47:42,668 INFO L448 ceAbstractionStarter]: For program point L4874-2(lines 4874 4879) no Hoare annotation was computed. [2018-11-28 20:47:42,668 INFO L448 ceAbstractionStarter]: For program point L4866(lines 4866 4872) no Hoare annotation was computed. [2018-11-28 20:47:42,669 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 5049 5060) the Hoare annotation is: true [2018-11-28 20:47:42,669 INFO L444 ceAbstractionStarter]: At program point L5054(line 5054) the Hoare annotation is: (not (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,669 INFO L448 ceAbstractionStarter]: For program point L5052(lines 5049 5060) no Hoare annotation was computed. [2018-11-28 20:47:42,669 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 5049 5060) no Hoare annotation was computed. [2018-11-28 20:47:42,669 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_1FINAL(lines 5061 5069) no Hoare annotation was computed. [2018-11-28 20:47:42,669 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_1EXIT(lines 5061 5069) no Hoare annotation was computed. [2018-11-28 20:47:42,669 INFO L444 ceAbstractionStarter]: At program point ldv_try_module_get_1ENTRY(lines 5061 5069) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,669 INFO L444 ceAbstractionStarter]: At program point L5065(line 5065) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (= |ldv_try_module_get_1_#in~module.base| ldv_try_module_get_1_~module.base) (= 1 ~ldv_module_refcounter~0) (= |ldv_try_module_get_1_#in~module.offset| ldv_try_module_get_1_~module.offset))) [2018-11-28 20:47:42,670 INFO L448 ceAbstractionStarter]: For program point L5065-1(line 5065) no Hoare annotation was computed. [2018-11-28 20:47:42,670 INFO L451 ceAbstractionStarter]: At program point sock_registerENTRY(lines 5107 5109) the Hoare annotation is: true [2018-11-28 20:47:42,670 INFO L448 ceAbstractionStarter]: For program point sock_registerEXIT(lines 5107 5109) no Hoare annotation was computed. [2018-11-28 20:47:42,670 INFO L448 ceAbstractionStarter]: For program point sock_registerFINAL(lines 5107 5109) no Hoare annotation was computed. [2018-11-28 20:47:42,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 20:47:42,670 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= 1 ~ldv_module_refcounter~0) [2018-11-28 20:47:42,670 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 20:47:42,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 20:47:42,671 INFO L451 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 5083 5085) the Hoare annotation is: true [2018-11-28 20:47:42,671 INFO L448 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 5083 5085) no Hoare annotation was computed. [2018-11-28 20:47:42,671 INFO L444 ceAbstractionStarter]: At program point L5023(line 5023) the Hoare annotation is: (< |old(~ldv_module_refcounter~0)| 2) [2018-11-28 20:47:42,671 INFO L448 ceAbstractionStarter]: For program point L5020-2(lines 5017 5032) no Hoare annotation was computed. [2018-11-28 20:47:42,671 INFO L448 ceAbstractionStarter]: For program point L5021(lines 5021 5026) no Hoare annotation was computed. [2018-11-28 20:47:42,671 INFO L448 ceAbstractionStarter]: For program point L5020(lines 5020 5029) no Hoare annotation was computed. [2018-11-28 20:47:42,671 INFO L448 ceAbstractionStarter]: For program point L5021-1(lines 5021 5026) no Hoare annotation was computed. [2018-11-28 20:47:42,671 INFO L444 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 5017 5032) the Hoare annotation is: (or (< |old(~ldv_module_refcounter~0)| 2) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,671 INFO L448 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 5017 5032) no Hoare annotation was computed. [2018-11-28 20:47:42,671 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2018-11-28 20:47:42,672 INFO L451 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2018-11-28 20:47:42,672 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2018-11-28 20:47:42,672 INFO L448 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 4909 4917) no Hoare annotation was computed. [2018-11-28 20:47:42,672 INFO L451 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 4909 4917) the Hoare annotation is: true [2018-11-28 20:47:42,672 INFO L448 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 4909 4917) no Hoare annotation was computed. [2018-11-28 20:47:42,672 INFO L451 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4981 4986) the Hoare annotation is: true [2018-11-28 20:47:42,672 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4981 4986) no Hoare annotation was computed. [2018-11-28 20:47:42,672 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4984) no Hoare annotation was computed. [2018-11-28 20:47:42,672 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4981 4986) no Hoare annotation was computed. [2018-11-28 20:47:42,673 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_2FINAL(lines 5070 5078) no Hoare annotation was computed. [2018-11-28 20:47:42,673 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_2EXIT(lines 5070 5078) no Hoare annotation was computed. [2018-11-28 20:47:42,673 INFO L444 ceAbstractionStarter]: At program point ldv_module_put_2ENTRY(lines 5070 5078) the Hoare annotation is: (or (< |old(~ldv_module_refcounter~0)| 2) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-28 20:47:42,673 INFO L444 ceAbstractionStarter]: At program point L5074(line 5074) the Hoare annotation is: (or (and (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) (= ldv_module_put_2_~ldv_func_arg1.base |ldv_module_put_2_#in~ldv_func_arg1.base|) (= ldv_module_put_2_~ldv_func_arg1.offset |ldv_module_put_2_#in~ldv_func_arg1.offset|)) (< |old(~ldv_module_refcounter~0)| 2)) [2018-11-28 20:47:42,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:47:42 BoogieIcfgContainer [2018-11-28 20:47:42,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:47:42,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:47:42,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:47:42,699 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:47:42,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:47:32" (3/4) ... [2018-11-28 20:47:42,704 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 20:47:42,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 20:47:42,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-11-28 20:47:42,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-11-28 20:47:42,711 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_unregister [2018-11-28 20:47:42,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_int [2018-11-28 20:47:42,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 20:47:42,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-11-28 20:47:42,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-28 20:47:42,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_1 [2018-11-28 20:47:42,712 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_register [2018-11-28 20:47:42,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2018-11-28 20:47:42,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-11-28 20:47:42,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-11-28 20:47:42,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-11-28 20:47:42,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-28 20:47:42,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_2 [2018-11-28 20:47:42,721 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-28 20:47:42,722 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 20:47:42,722 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 20:47:42,723 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 20:47:42,756 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) [2018-11-28 20:47:42,756 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-11-28 20:47:42,756 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-11-28 20:47:42,756 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) [2018-11-28 20:47:42,757 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-11-28 20:47:42,757 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-11-28 20:47:42,826 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:47:42,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:47:42,827 INFO L168 Benchmark]: Toolchain (without parser) took 12490.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 248.5 MB). Free memory was 947.2 MB in the beginning and 1.0 GB in the end (delta: -58.4 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:47:42,828 INFO L168 Benchmark]: CDTParser took 0.42 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. [2018-11-28 20:47:42,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1437.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. [2018-11-28 20:47:42,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:47:42,830 INFO L168 Benchmark]: Boogie Preprocessor took 71.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:47:42,830 INFO L168 Benchmark]: RCFGBuilder took 937.57 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: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. [2018-11-28 20:47:42,830 INFO L168 Benchmark]: TraceAbstraction took 9844.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.7 MB). Peak memory consumption was 155.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:47:42,831 INFO L168 Benchmark]: Witness Printer took 127.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:47:42,833 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.42 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 1437.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 937.57 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: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9844.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.7 MB). Peak memory consumption was 155.7 MB. Max. memory is 11.5 GB. * Witness Printer took 127.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4984]: 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: 4930]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4864]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) - InvariantResult [Line: 4945]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 94 locations, 1 error locations. SAFE Result, 9.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 750 SDtfs, 561 SDslu, 2570 SDs, 0 SdLazy, 689 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 231 PreInvPairs, 248 NumberOfFragments, 507 HoareAnnotationTreeSize, 231 FomulaSimplifications, 624 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 35 FomulaSimplificationsInter, 474 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 145400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...