./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i.pp.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i.pp.i -s /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a89a64f5289ba9e048bf8d3e685f4757a2b71072 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:59:49,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:59:49,494 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:59:49,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:59:49,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:59:49,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:59:49,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:59:49,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:59:49,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:59:49,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:59:49,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:59:49,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:59:49,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:59:49,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:59:49,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:59:49,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:59:49,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:59:49,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:59:49,513 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:59:49,514 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:59:49,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:59:49,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:59:49,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:59:49,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:59:49,517 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:59:49,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:59:49,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:59:49,519 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:59:49,519 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:59:49,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:59:49,520 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:59:49,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:59:49,520 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:59:49,521 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:59:49,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:59:49,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:59:49,522 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-10 09:59:49,531 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:59:49,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:59:49,532 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:59:49,532 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:59:49,532 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:59:49,532 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:59:49,532 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 09:59:49,532 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:59:49,533 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-10 09:59:49,533 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 09:59:49,533 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 09:59:49,533 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:59:49,533 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:59:49,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:59:49,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:59:49,534 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:59:49,534 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:59:49,534 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:59:49,534 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:59:49,534 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:59:49,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:59:49,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:59:49,535 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:59:49,535 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:59:49,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:59:49,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:59:49,535 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:59:49,535 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:59:49,536 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 09:59:49,536 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:59:49,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:59:49,536 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 09:59:49,536 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-10 09:59:49,536 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan 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 -> Taipan 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 -> a89a64f5289ba9e048bf8d3e685f4757a2b71072 [2018-11-10 09:59:49,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:59:49,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:59:49,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:59:49,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:59:49,573 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:59:49,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 09:59:49,621 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/data/023cfa252/0fe05b1204e64a26922edb36766c47be/FLAGa9e1c2215 [2018-11-10 09:59:50,039 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:59:50,039 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 09:59:50,058 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/data/023cfa252/0fe05b1204e64a26922edb36766c47be/FLAGa9e1c2215 [2018-11-10 09:59:50,071 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/data/023cfa252/0fe05b1204e64a26922edb36766c47be [2018-11-10 09:59:50,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:59:50,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:59:50,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:59:50,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:59:50,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:59:50,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:50,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19740b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50, skipping insertion in model container [2018-11-10 09:59:50,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:50,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:59:50,141 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:59:50,655 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:59:50,672 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:59:50,927 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:59:50,947 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:59:50,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50 WrapperNode [2018-11-10 09:59:50,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:59:50,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:59:50,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:59:50,949 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:59:50,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:50,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:50,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:59:50,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:59:50,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:59:50,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:59:50,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:50,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:50,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:51,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:51,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:51,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:51,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... [2018-11-10 09:59:51,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:59:51,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:59:51,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:59:51,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:59:51,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/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-10 09:59:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:59:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:59:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-10 09:59:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-10 09:59:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-10 09:59:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-10 09:59:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-11-10 09:59:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-11-10 09:59:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-10 09:59:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-10 09:59:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-10 09:59:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-10 09:59:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:59:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:59:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-10 09:59:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-10 09:59:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_1 [2018-11-10 09:59:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_1 [2018-11-10 09:59:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:59:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:59:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-10 09:59:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-10 09:59:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-10 09:59:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-10 09:59:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_2 [2018-11-10 09:59:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_2 [2018-11-10 09:59:51,235 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:59:51,235 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:59:51,503 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:59:51,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:51 BoogieIcfgContainer [2018-11-10 09:59:51,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:59:51,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:59:51,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:59:51,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:59:51,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:59:50" (1/3) ... [2018-11-10 09:59:51,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee07975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:59:51, skipping insertion in model container [2018-11-10 09:59:51,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:50" (2/3) ... [2018-11-10 09:59:51,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee07975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:59:51, skipping insertion in model container [2018-11-10 09:59:51,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:51" (3/3) ... [2018-11-10 09:59:51,510 INFO L112 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox_false-termination.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 09:59:51,518 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:59:51,525 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:59:51,538 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:59:51,564 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:59:51,564 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:59:51,564 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:59:51,564 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:59:51,564 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:59:51,564 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:59:51,565 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:59:51,565 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:59:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-10 09:59:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 09:59:51,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:59:51,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:59:51,587 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:59:51,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:51,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1059402160, now seen corresponding path program 1 times [2018-11-10 09:59:51,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:59:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:51,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:59:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:51,784 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-10 09:59:51,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:59:51,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:59:51,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:59:51,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:59:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:59:51,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:59:51,798 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2018-11-10 09:59:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:59:51,848 INFO L93 Difference]: Finished difference Result 191 states and 242 transitions. [2018-11-10 09:59:51,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:59:51,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-10 09:59:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:59:51,858 INFO L225 Difference]: With dead ends: 191 [2018-11-10 09:59:51,858 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 09:59:51,860 INFO L605 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-10 09:59:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 09:59:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-11-10 09:59:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 09:59:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2018-11-10 09:59:51,901 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 16 [2018-11-10 09:59:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:59:51,901 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2018-11-10 09:59:51,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:59:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2018-11-10 09:59:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 09:59:51,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:59:51,904 INFO L375 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] [2018-11-10 09:59:51,904 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:59:51,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash -585637001, now seen corresponding path program 1 times [2018-11-10 09:59:51,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:59:51,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:51,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:51,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:59:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:52,044 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-10 09:59:52,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:59:52,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 09:59:52,044 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:59:52,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:59:52,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:59:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:59:52,046 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 7 states. [2018-11-10 09:59:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:59:52,106 INFO L93 Difference]: Finished difference Result 207 states and 254 transitions. [2018-11-10 09:59:52,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:59:52,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-10 09:59:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:59:52,111 INFO L225 Difference]: With dead ends: 207 [2018-11-10 09:59:52,111 INFO L226 Difference]: Without dead ends: 108 [2018-11-10 09:59:52,112 INFO L605 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-10 09:59:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-10 09:59:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2018-11-10 09:59:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 09:59:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2018-11-10 09:59:52,123 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 48 [2018-11-10 09:59:52,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:59:52,124 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2018-11-10 09:59:52,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:59:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2018-11-10 09:59:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 09:59:52,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:59:52,126 INFO L375 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] [2018-11-10 09:59:52,126 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:59:52,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1243718701, now seen corresponding path program 1 times [2018-11-10 09:59:52,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:59:52,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:52,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:52,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:52,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:59:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:52,288 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-10 09:59:52,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:59:52,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 09:59:52,293 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:59:52,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:59:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:59:52,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:59:52,294 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand 7 states. [2018-11-10 09:59:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:59:52,612 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2018-11-10 09:59:52,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:59:52,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-10 09:59:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:59:52,615 INFO L225 Difference]: With dead ends: 181 [2018-11-10 09:59:52,615 INFO L226 Difference]: Without dead ends: 178 [2018-11-10 09:59:52,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:59:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-10 09:59:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2018-11-10 09:59:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-10 09:59:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2018-11-10 09:59:52,639 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 49 [2018-11-10 09:59:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:59:52,639 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2018-11-10 09:59:52,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:59:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2018-11-10 09:59:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:59:52,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:59:52,641 INFO L375 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] [2018-11-10 09:59:52,641 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:59:52,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -26818538, now seen corresponding path program 1 times [2018-11-10 09:59:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:59:52,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:52,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:52,645 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:59:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:52,725 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-10 09:59:52,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:59:52,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 09:59:52,726 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:59:52,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:59:52,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:59:52,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:59:52,727 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand 7 states. [2018-11-10 09:59:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:59:52,770 INFO L93 Difference]: Finished difference Result 291 states and 351 transitions. [2018-11-10 09:59:52,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:59:52,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-10 09:59:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:59:52,773 INFO L225 Difference]: With dead ends: 291 [2018-11-10 09:59:52,773 INFO L226 Difference]: Without dead ends: 167 [2018-11-10 09:59:52,774 INFO L605 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-10 09:59:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-10 09:59:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-11-10 09:59:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-10 09:59:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2018-11-10 09:59:52,790 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 50 [2018-11-10 09:59:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:59:52,790 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2018-11-10 09:59:52,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:59:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2018-11-10 09:59:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 09:59:52,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:59:52,792 INFO L375 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] [2018-11-10 09:59:52,792 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:59:52,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash -799234353, now seen corresponding path program 1 times [2018-11-10 09:59:52,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:59:52,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:52,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:52,797 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:59:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:53,079 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-10 09:59:53,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:59:53,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 09:59:53,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:59:53,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 09:59:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:59:53,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:59:53,081 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand 13 states. [2018-11-10 09:59:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:59:53,400 INFO L93 Difference]: Finished difference Result 275 states and 318 transitions. [2018-11-10 09:59:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 09:59:53,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-10 09:59:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:59:53,402 INFO L225 Difference]: With dead ends: 275 [2018-11-10 09:59:53,402 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 09:59:53,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-10 09:59:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 09:59:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2018-11-10 09:59:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 09:59:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2018-11-10 09:59:53,413 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 65 [2018-11-10 09:59:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:59:53,413 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2018-11-10 09:59:53,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 09:59:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2018-11-10 09:59:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 09:59:53,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:59:53,414 INFO L375 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] [2018-11-10 09:59:53,414 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:59:53,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash -267111145, now seen corresponding path program 1 times [2018-11-10 09:59:53,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:59:53,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:53,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:53,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:53,417 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:59:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:53,545 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-10 09:59:53,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:59:53,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 09:59:53,545 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:59:53,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 09:59:53,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:59:53,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:59:53,546 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand 9 states. [2018-11-10 09:59:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:59:53,648 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-11-10 09:59:53,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:59:53,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-10 09:59:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:59:53,651 INFO L225 Difference]: With dead ends: 125 [2018-11-10 09:59:53,651 INFO L226 Difference]: Without dead ends: 116 [2018-11-10 09:59:53,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:59:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-10 09:59:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-11-10 09:59:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-10 09:59:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2018-11-10 09:59:53,661 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 67 [2018-11-10 09:59:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:59:53,661 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2018-11-10 09:59:53,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 09:59:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2018-11-10 09:59:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 09:59:53,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:59:53,663 INFO L375 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, 1, 1, 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-10 09:59:53,663 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:59:53,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash -514135533, now seen corresponding path program 1 times [2018-11-10 09:59:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:59:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:53,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:59:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:59:53,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:59:53,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 09:59:53,752 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:59:53,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:59:53,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:59:53,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:59:53,753 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand 6 states. [2018-11-10 09:59:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:59:53,841 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-11-10 09:59:53,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:59:53,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-10 09:59:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:59:53,842 INFO L225 Difference]: With dead ends: 116 [2018-11-10 09:59:53,842 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:59:53,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:59:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:59:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:59:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:59:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:59:53,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2018-11-10 09:59:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:59:53,843 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:59:53,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:59:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:59:53,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:59:53,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:59:54,102 INFO L421 ceAbstractionStarter]: At program point L4959(line 4959) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,102 INFO L425 ceAbstractionStarter]: For program point L4959-1(line 4959) no Hoare annotation was computed. [2018-11-10 09:59:54,102 INFO L425 ceAbstractionStarter]: For program point L4961(lines 4961 4965) no Hoare annotation was computed. [2018-11-10 09:59:54,102 INFO L425 ceAbstractionStarter]: For program point L4992(lines 4992 4996) no Hoare annotation was computed. [2018-11-10 09:59:54,102 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4946 5007) no Hoare annotation was computed. [2018-11-10 09:59:54,102 INFO L425 ceAbstractionStarter]: For program point L4978(line 4978) no Hoare annotation was computed. [2018-11-10 09:59:54,102 INFO L425 ceAbstractionStarter]: For program point L5003(line 5003) no Hoare annotation was computed. [2018-11-10 09:59:54,103 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4946 5007) no Hoare annotation was computed. [2018-11-10 09:59:54,103 INFO L421 ceAbstractionStarter]: At program point L4972(lines 4971 4986) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,103 INFO L421 ceAbstractionStarter]: At program point L4999(lines 4955 5006) the Hoare annotation is: (or (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 09:59:54,103 INFO L421 ceAbstractionStarter]: At program point L4995(lines 4955 5006) the Hoare annotation is: (or (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 09:59:54,103 INFO L425 ceAbstractionStarter]: For program point $Ultimate##5(lines 4975 4985) no Hoare annotation was computed. [2018-11-10 09:59:54,103 INFO L425 ceAbstractionStarter]: For program point $Ultimate##6(lines 4975 4985) no Hoare annotation was computed. [2018-11-10 09:59:54,103 INFO L421 ceAbstractionStarter]: At program point L4993(lines 4955 5006) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,103 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 4946 5007) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,103 INFO L421 ceAbstractionStarter]: At program point L4987(lines 4955 5006) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,103 INFO L425 ceAbstractionStarter]: For program point L4971(lines 4971 4986) no Hoare annotation was computed. [2018-11-10 09:59:54,103 INFO L421 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 5029 5048) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,104 INFO L425 ceAbstractionStarter]: For program point L5037(lines 5037 5042) no Hoare annotation was computed. [2018-11-10 09:59:54,104 INFO L425 ceAbstractionStarter]: For program point L5033(lines 5033 5045) no Hoare annotation was computed. [2018-11-10 09:59:54,104 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 5029 5048) no Hoare annotation was computed. [2018-11-10 09:59:54,104 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 5029 5048) no Hoare annotation was computed. [2018-11-10 09:59:54,104 INFO L425 ceAbstractionStarter]: For program point pppox_initFINAL(lines 4922 4931) no Hoare annotation was computed. [2018-11-10 09:59:54,104 INFO L428 ceAbstractionStarter]: At program point pppox_initENTRY(lines 4922 4931) the Hoare annotation is: true [2018-11-10 09:59:54,104 INFO L425 ceAbstractionStarter]: For program point pppox_initEXIT(lines 4922 4931) no Hoare annotation was computed. [2018-11-10 09:59:54,104 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:59:54,104 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) [2018-11-10 09:59:54,104 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:59:54,104 INFO L421 ceAbstractionStarter]: At program point L4914(line 4914) the Hoare annotation is: (or (and (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 ((.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 18446744073709551616 (div (+ .cse0 (+ .cse1 (- 1))) 18446744073709551616)) 18446744073709551615))))) (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (= pppox_create_~tmp~2 1)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 09:59:54,105 INFO L425 ceAbstractionStarter]: For program point L4885(lines 4885 4892) no Hoare annotation was computed. [2018-11-10 09:59:54,105 INFO L425 ceAbstractionStarter]: For program point L4914-1(line 4914) no Hoare annotation was computed. [2018-11-10 09:59:54,105 INFO L425 ceAbstractionStarter]: For program point pppox_createFINAL(lines 4879 4920) no Hoare annotation was computed. [2018-11-10 09:59:54,105 INFO L425 ceAbstractionStarter]: For program point L4894(lines 4894 4900) no Hoare annotation was computed. [2018-11-10 09:59:54,105 INFO L421 ceAbstractionStarter]: At program point pppox_createENTRY(lines 4879 4920) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,105 INFO L425 ceAbstractionStarter]: For program point L4894-2(lines 4894 4900) no Hoare annotation was computed. [2018-11-10 09:59:54,105 INFO L425 ceAbstractionStarter]: For program point L4888(lines 4888 4892) no Hoare annotation was computed. [2018-11-10 09:59:54,105 INFO L421 ceAbstractionStarter]: At program point L4915(line 4915) the Hoare annotation is: (or (and (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 ((.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 18446744073709551616 (div (+ .cse0 (+ .cse1 (- 1))) 18446744073709551616)) 18446744073709551615))))) (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (<= (+ |pppox_create_#t~mem45.base| |pppox_create_#t~mem45.offset|) (+ (* 18446744073709551616 (div (+ |pppox_create_#t~mem45.offset| (+ |pppox_create_#t~mem45.base| (- 1))) 18446744073709551616)) 18446744073709551615)) (= pppox_create_~tmp~2 1)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 09:59:54,105 INFO L425 ceAbstractionStarter]: For program point L4915-1(line 4915) no Hoare annotation was computed. [2018-11-10 09:59:54,105 INFO L421 ceAbstractionStarter]: At program point L4917(lines 4883 4919) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,106 INFO L425 ceAbstractionStarter]: For program point L4907(lines 4907 4911) no Hoare annotation was computed. [2018-11-10 09:59:54,106 INFO L425 ceAbstractionStarter]: For program point pppox_createEXIT(lines 4879 4920) no Hoare annotation was computed. [2018-11-10 09:59:54,106 INFO L421 ceAbstractionStarter]: At program point L4905(line 4905) 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-10 09:59:54,106 INFO L425 ceAbstractionStarter]: For program point L4905-1(line 4905) no Hoare annotation was computed. [2018-11-10 09:59:54,106 INFO L425 ceAbstractionStarter]: For program point L4901(lines 4901 4912) no Hoare annotation was computed. [2018-11-10 09:59:54,106 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 5086 5099) the Hoare annotation is: true [2018-11-10 09:59:54,106 INFO L425 ceAbstractionStarter]: For program point L5090(lines 5086 5099) no Hoare annotation was computed. [2018-11-10 09:59:54,106 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 5086 5099) no Hoare annotation was computed. [2018-11-10 09:59:54,106 INFO L421 ceAbstractionStarter]: At program point L5092(line 5092) the Hoare annotation is: (not (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,106 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_get_1FINAL(lines 5100 5109) no Hoare annotation was computed. [2018-11-10 09:59:54,107 INFO L421 ceAbstractionStarter]: At program point L5105(line 5105) 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-10 09:59:54,107 INFO L425 ceAbstractionStarter]: For program point L5105-1(line 5105) no Hoare annotation was computed. [2018-11-10 09:59:54,107 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_get_1EXIT(lines 5100 5109) no Hoare annotation was computed. [2018-11-10 09:59:54,107 INFO L421 ceAbstractionStarter]: At program point ldv_try_module_get_1ENTRY(lines 5100 5109) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= 1 ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,107 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:59:54,107 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= 1 ~ldv_module_refcounter~0) [2018-11-10 09:59:54,107 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:59:54,107 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:59:54,107 INFO L425 ceAbstractionStarter]: For program point L5054(lines 5054 5060) no Hoare annotation was computed. [2018-11-10 09:59:54,107 INFO L421 ceAbstractionStarter]: At program point L5056(line 5056) the Hoare annotation is: (< |old(~ldv_module_refcounter~0)| 2) [2018-11-10 09:59:54,107 INFO L425 ceAbstractionStarter]: For program point L5053-2(lines 5049 5067) no Hoare annotation was computed. [2018-11-10 09:59:54,107 INFO L425 ceAbstractionStarter]: For program point L5053(lines 5053 5064) no Hoare annotation was computed. [2018-11-10 09:59:54,107 INFO L425 ceAbstractionStarter]: For program point L5054-1(lines 5054 5060) no Hoare annotation was computed. [2018-11-10 09:59:54,108 INFO L421 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 5049 5067) the Hoare annotation is: (or (< |old(~ldv_module_refcounter~0)| 2) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,108 INFO L425 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 5049 5067) no Hoare annotation was computed. [2018-11-10 09:59:54,108 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:59:54,108 INFO L428 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:59:54,108 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:59:54,108 INFO L425 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 4932 4941) no Hoare annotation was computed. [2018-11-10 09:59:54,108 INFO L428 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 4932 4941) the Hoare annotation is: true [2018-11-10 09:59:54,108 INFO L425 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 4932 4941) no Hoare annotation was computed. [2018-11-10 09:59:54,108 INFO L428 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 5008 5014) the Hoare annotation is: true [2018-11-10 09:59:54,108 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 5008 5014) no Hoare annotation was computed. [2018-11-10 09:59:54,108 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 5008 5014) no Hoare annotation was computed. [2018-11-10 09:59:54,109 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5012) no Hoare annotation was computed. [2018-11-10 09:59:54,109 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_2FINAL(lines 5110 5119) no Hoare annotation was computed. [2018-11-10 09:59:54,109 INFO L421 ceAbstractionStarter]: At program point L5115(line 5115) 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-10 09:59:54,109 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_2EXIT(lines 5110 5119) no Hoare annotation was computed. [2018-11-10 09:59:54,109 INFO L421 ceAbstractionStarter]: At program point ldv_module_put_2ENTRY(lines 5110 5119) the Hoare annotation is: (or (< |old(~ldv_module_refcounter~0)| 2) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-10 09:59:54,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:59:54 BoogieIcfgContainer [2018-11-10 09:59:54,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:59:54,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:59:54,119 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:59:54,119 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:59:54,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:51" (3/4) ... [2018-11-10 09:59:54,123 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:59:54,128 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:59:54,128 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_1 [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-11-10 09:59:54,129 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-10 09:59:54,130 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_2 [2018-11-10 09:59:54,135 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2018-11-10 09:59:54,135 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-10 09:59:54,136 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-10 09:59:54,136 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 09:59:54,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) [2018-11-10 09:59:54,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-11-10 09:59:54,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-11-10 09:59:54,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) [2018-11-10 09:59:54,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-11-10 09:59:54,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter [2018-11-10 09:59:54,183 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_527e2b3a-772c-46ba-9cf5-315e5d15106a/bin-2019/utaipan/witness.graphml [2018-11-10 09:59:54,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:59:54,184 INFO L168 Benchmark]: Toolchain (without parser) took 4109.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 952.6 MB in the beginning and 1.0 GB in the end (delta: -58.9 MB). Peak memory consumption was 171.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:54,185 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:59:54,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -121.7 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:54,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.21 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: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:54,185 INFO L168 Benchmark]: Boogie Preprocessor took 26.83 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-10 09:59:54,185 INFO L168 Benchmark]: RCFGBuilder took 489.05 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: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:54,186 INFO L168 Benchmark]: TraceAbstraction took 2614.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 145.7 kB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:54,186 INFO L168 Benchmark]: Witness Printer took 64.08 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:54,187 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 872.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -121.7 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.21 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: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.83 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 489.05 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: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2614.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 145.7 kB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. * Witness Printer took 64.08 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5012]: 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: 4955]: Loop Invariant Derived loop invariant: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) - InvariantResult [Line: 4883]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4955]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4971]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4955]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || 1 == ldv_module_refcounter - InvariantResult [Line: 4955]: Loop Invariant Derived loop invariant: 1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 78 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 556 SDtfs, 483 SDslu, 1917 SDs, 0 SdLazy, 527 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=3, 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, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 157 PreInvPairs, 172 NumberOfFragments, 464 HoareAnnotationTreeSize, 157 FomulaSimplifications, 349 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 361 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 382 ConstructedInterpolants, 0 QuantifiedInterpolants, 97064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 41/41 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...