/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:43:36,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:43:36,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:43:36,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:43:36,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:43:36,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:43:36,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:43:36,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:43:36,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:43:36,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:43:36,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:43:36,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:43:36,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:43:36,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:43:36,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:43:36,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:43:36,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:43:36,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:43:36,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:43:36,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:43:36,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:43:36,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:43:36,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:43:36,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:43:36,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:43:36,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:43:36,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:43:36,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:43:36,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:43:36,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:43:36,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:43:36,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:43:36,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:43:36,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:43:36,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:43:36,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:43:36,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:43:36,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:43:36,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:43:36,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:43:36,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:43:36,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 19:43:36,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:43:36,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:43:36,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:43:36,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:43:36,138 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:43:36,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:43:36,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:43:36,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:43:36,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:43:36,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:43:36,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:43:36,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:43:36,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:43:36,141 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:43:36,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:43:36,141 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:43:36,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:43:36,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:43:36,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:43:36,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:43:36,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:43:36,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:43:36,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:43:36,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:43:36,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:43:36,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:43:36,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:43:36,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:43:36,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:43:36,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:43:36,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:43:36,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:43:36,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:43:36,432 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:43:36,432 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2019-11-06 19:43:36,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79bd6e36e/b3e8323b8f644be5a7f8f24bb170dbf3/FLAGaa116ad0c [2019-11-06 19:43:37,269 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:43:37,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2019-11-06 19:43:37,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79bd6e36e/b3e8323b8f644be5a7f8f24bb170dbf3/FLAGaa116ad0c [2019-11-06 19:43:37,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79bd6e36e/b3e8323b8f644be5a7f8f24bb170dbf3 [2019-11-06 19:43:37,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:43:37,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:43:37,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:43:37,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:43:37,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:43:37,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:43:37" (1/1) ... [2019-11-06 19:43:37,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45010d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:37, skipping insertion in model container [2019-11-06 19:43:37,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:43:37" (1/1) ... [2019-11-06 19:43:37,404 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:43:37,494 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:43:38,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:43:38,441 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:43:38,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:43:38,767 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:43:38,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38 WrapperNode [2019-11-06 19:43:38,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:43:38,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:43:38,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:43:38,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:43:38,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (1/1) ... [2019-11-06 19:43:38,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (1/1) ... [2019-11-06 19:43:38,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (1/1) ... [2019-11-06 19:43:38,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (1/1) ... [2019-11-06 19:43:38,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (1/1) ... [2019-11-06 19:43:38,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (1/1) ... [2019-11-06 19:43:38,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (1/1) ... [2019-11-06 19:43:38,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:43:38,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:43:38,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:43:38,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:43:38,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:43:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:43:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:43:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-11-06 19:43:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-11-06 19:43:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock [2019-11-06 19:43:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_sk [2019-11-06 19:43:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure register_pppox_proto [2019-11-06 19:43:38,946 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pppox_proto [2019-11-06 19:43:38,946 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_unbind_sock [2019-11-06 19:43:38,946 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_ioctl [2019-11-06 19:43:38,946 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2019-11-06 19:43:38,946 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2019-11-06 19:43:38,946 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2019-11-06 19:43:38,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:43:38,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-11-06 19:43:38,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_get [2019-11-06 19:43:38,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2019-11-06 19:43:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2019-11-06 19:43:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_and_exit [2019-11-06 19:43:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_refcount [2019-11-06 19:43:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-11-06 19:43:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_1 [2019-11-06 19:43:38,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_2 [2019-11-06 19:43:38,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_module [2019-11-06 19:43:38,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-11-06 19:43:38,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_int [2019-11-06 19:43:38,949 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock_nested [2019-11-06 19:43:38,949 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-11-06 19:43:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_index [2019-11-06 19:43:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unregister_channel [2019-11-06 19:43:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure release_sock [2019-11-06 19:43:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2019-11-06 19:43:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2019-11-06 19:43:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-11-06 19:43:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-11-06 19:43:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:43:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-11-06 19:43:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure __request_module [2019-11-06 19:43:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_1 [2019-11-06 19:43:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_2 [2019-11-06 19:43:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2019-11-06 19:43:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_get [2019-11-06 19:43:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2019-11-06 19:43:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_refcount [2019-11-06 19:43:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_and_exit [2019-11-06 19:43:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2019-11-06 19:43:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2019-11-06 19:43:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2019-11-06 19:43:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2019-11-06 19:43:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock_nested [2019-11-06 19:43:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock [2019-11-06 19:43:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure release_sock [2019-11-06 19:43:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_sk [2019-11-06 19:43:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure register_pppox_proto [2019-11-06 19:43:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pppox_proto [2019-11-06 19:43:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_unbind_sock [2019-11-06 19:43:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_ioctl [2019-11-06 19:43:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:43:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:43:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:43:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:43:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-11-06 19:43:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2019-11-06 19:43:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 19:43:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-11-06 19:43:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2019-11-06 19:43:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2019-11-06 19:43:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-11-06 19:43:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-11-06 19:43:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:43:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:43:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-11-06 19:43:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_int [2019-11-06 19:43:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 19:43:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-11-06 19:43:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:43:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-06 19:43:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:43:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:43:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-06 19:43:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-06 19:43:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:43:39,388 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 19:43:39,507 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-06 19:43:39,507 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-06 19:43:39,507 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 19:43:39,507 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 19:43:39,508 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 19:43:39,543 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-11-06 19:43:39,543 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-11-06 19:43:39,648 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_module_put_and_exitFINAL: assume true; [2019-11-06 19:43:39,781 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:43:39,781 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 19:43:39,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:43:39 BoogieIcfgContainer [2019-11-06 19:43:39,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:43:39,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:43:39,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:43:39,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:43:39,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:43:37" (1/3) ... [2019-11-06 19:43:39,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e52b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:43:39, skipping insertion in model container [2019-11-06 19:43:39,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:43:38" (2/3) ... [2019-11-06 19:43:39,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e52b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:43:39, skipping insertion in model container [2019-11-06 19:43:39,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:43:39" (3/3) ... [2019-11-06 19:43:39,791 INFO L109 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox.ko.cil.out.i [2019-11-06 19:43:39,800 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:43:39,808 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 19:43:39,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 19:43:39,842 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:43:39,842 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:43:39,842 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:43:39,842 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:43:39,842 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:43:39,842 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:43:39,842 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:43:39,843 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:43:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-11-06 19:43:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:43:39,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:43:39,870 INFO L410 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] [2019-11-06 19:43:39,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:43:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:43:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1181566854, now seen corresponding path program 1 times [2019-11-06 19:43:39,888 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:43:39,888 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919073702] [2019-11-06 19:43:39,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:43:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:43:40,414 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919073702] [2019-11-06 19:43:40,415 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:43:40,415 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:43:40,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793003697] [2019-11-06 19:43:40,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:43:40,421 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:43:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:43:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:43:40,438 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 4 states. [2019-11-06 19:43:40,636 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-06 19:43:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:43:41,201 INFO L93 Difference]: Finished difference Result 241 states and 297 transitions. [2019-11-06 19:43:41,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:43:41,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-06 19:43:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:43:41,220 INFO L225 Difference]: With dead ends: 241 [2019-11-06 19:43:41,220 INFO L226 Difference]: Without dead ends: 153 [2019-11-06 19:43:41,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:43:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-06 19:43:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2019-11-06 19:43:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-06 19:43:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2019-11-06 19:43:41,298 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 24 [2019-11-06 19:43:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:43:41,298 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2019-11-06 19:43:41,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:43:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2019-11-06 19:43:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-06 19:43:41,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:43:41,302 INFO L410 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] [2019-11-06 19:43:41,302 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:43:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:43:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash -434919225, now seen corresponding path program 1 times [2019-11-06 19:43:41,303 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:43:41,303 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822668273] [2019-11-06 19:43:41,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:43:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:43:41,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822668273] [2019-11-06 19:43:41,628 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:43:41,628 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 19:43:41,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44617636] [2019-11-06 19:43:41,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:43:41,643 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:43:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:43:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:43:41,644 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand 9 states. [2019-11-06 19:43:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:43:42,472 INFO L93 Difference]: Finished difference Result 269 states and 321 transitions. [2019-11-06 19:43:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 19:43:42,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-06 19:43:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:43:42,476 INFO L225 Difference]: With dead ends: 269 [2019-11-06 19:43:42,477 INFO L226 Difference]: Without dead ends: 139 [2019-11-06 19:43:42,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-06 19:43:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-06 19:43:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2019-11-06 19:43:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-06 19:43:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2019-11-06 19:43:42,511 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 56 [2019-11-06 19:43:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:43:42,512 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2019-11-06 19:43:42,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:43:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2019-11-06 19:43:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-06 19:43:42,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:43:42,515 INFO L410 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] [2019-11-06 19:43:42,515 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:43:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:43:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1834921373, now seen corresponding path program 1 times [2019-11-06 19:43:42,516 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:43:42,516 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773292059] [2019-11-06 19:43:42,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:43:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:43:42,733 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773292059] [2019-11-06 19:43:42,733 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:43:42,733 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 19:43:42,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997096581] [2019-11-06 19:43:42,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 19:43:42,734 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:43:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 19:43:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:43:42,735 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 8 states. [2019-11-06 19:43:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:43:43,663 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2019-11-06 19:43:43,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 19:43:43,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-11-06 19:43:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:43:43,667 INFO L225 Difference]: With dead ends: 210 [2019-11-06 19:43:43,667 INFO L226 Difference]: Without dead ends: 207 [2019-11-06 19:43:43,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:43:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-06 19:43:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2019-11-06 19:43:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-06 19:43:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2019-11-06 19:43:43,697 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 62 [2019-11-06 19:43:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:43:43,700 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2019-11-06 19:43:43,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 19:43:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2019-11-06 19:43:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 19:43:43,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:43:43,704 INFO L410 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] [2019-11-06 19:43:43,704 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:43:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:43:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1289390946, now seen corresponding path program 1 times [2019-11-06 19:43:43,705 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:43:43,707 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932124774] [2019-11-06 19:43:43,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:43:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:43:43,955 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932124774] [2019-11-06 19:43:43,955 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:43:43,955 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 19:43:43,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347759604] [2019-11-06 19:43:43,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:43:43,957 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:43:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:43:43,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:43:43,957 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand 9 states. [2019-11-06 19:43:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:43:44,423 INFO L93 Difference]: Finished difference Result 330 states and 390 transitions. [2019-11-06 19:43:44,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:43:44,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-06 19:43:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:43:44,427 INFO L225 Difference]: With dead ends: 330 [2019-11-06 19:43:44,428 INFO L226 Difference]: Without dead ends: 193 [2019-11-06 19:43:44,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:43:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-06 19:43:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2019-11-06 19:43:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-06 19:43:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2019-11-06 19:43:44,461 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 66 [2019-11-06 19:43:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:43:44,464 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2019-11-06 19:43:44,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:43:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2019-11-06 19:43:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-06 19:43:44,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:43:44,467 INFO L410 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] [2019-11-06 19:43:44,467 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:43:44,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:43:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash -566743229, now seen corresponding path program 1 times [2019-11-06 19:43:44,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:43:44,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197407767] [2019-11-06 19:43:44,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:43:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:43:44,709 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197407767] [2019-11-06 19:43:44,709 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:43:44,710 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:43:44,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031203685] [2019-11-06 19:43:44,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:43:44,711 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:43:44,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:43:44,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:43:44,711 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand 7 states. [2019-11-06 19:43:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:43:45,399 INFO L93 Difference]: Finished difference Result 378 states and 453 transitions. [2019-11-06 19:43:45,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:43:45,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-11-06 19:43:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:43:45,401 INFO L225 Difference]: With dead ends: 378 [2019-11-06 19:43:45,402 INFO L226 Difference]: Without dead ends: 208 [2019-11-06 19:43:45,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:43:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-06 19:43:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 196. [2019-11-06 19:43:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-06 19:43:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2019-11-06 19:43:45,423 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 81 [2019-11-06 19:43:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:43:45,423 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2019-11-06 19:43:45,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:43:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2019-11-06 19:43:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-06 19:43:45,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:43:45,426 INFO L410 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] [2019-11-06 19:43:45,426 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:43:45,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:43:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash -122842555, now seen corresponding path program 1 times [2019-11-06 19:43:45,427 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:43:45,427 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807728117] [2019-11-06 19:43:45,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:43:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:43:46,075 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807728117] [2019-11-06 19:43:46,076 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:43:46,076 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-06 19:43:46,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73475957] [2019-11-06 19:43:46,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 19:43:46,078 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:43:46,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 19:43:46,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:43:46,078 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand 16 states. [2019-11-06 19:43:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:43:48,055 INFO L93 Difference]: Finished difference Result 317 states and 360 transitions. [2019-11-06 19:43:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 19:43:48,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-11-06 19:43:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:43:48,058 INFO L225 Difference]: With dead ends: 317 [2019-11-06 19:43:48,058 INFO L226 Difference]: Without dead ends: 168 [2019-11-06 19:43:48,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2019-11-06 19:43:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-06 19:43:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2019-11-06 19:43:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-06 19:43:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2019-11-06 19:43:48,073 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 81 [2019-11-06 19:43:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:43:48,074 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2019-11-06 19:43:48,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 19:43:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2019-11-06 19:43:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-06 19:43:48,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:43:48,076 INFO L410 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] [2019-11-06 19:43:48,076 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:43:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:43:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2001053501, now seen corresponding path program 1 times [2019-11-06 19:43:48,077 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:43:48,077 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968012967] [2019-11-06 19:43:48,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:43:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 19:43:48,409 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968012967] [2019-11-06 19:43:48,409 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:43:48,410 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 19:43:48,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361310198] [2019-11-06 19:43:48,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 19:43:48,410 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:43:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 19:43:48,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:43:48,411 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 10 states. [2019-11-06 19:43:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:43:48,839 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2019-11-06 19:43:48,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 19:43:48,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-11-06 19:43:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:43:48,841 INFO L225 Difference]: With dead ends: 150 [2019-11-06 19:43:48,841 INFO L226 Difference]: Without dead ends: 138 [2019-11-06 19:43:48,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-11-06 19:43:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-06 19:43:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-11-06 19:43:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-06 19:43:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2019-11-06 19:43:48,856 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 83 [2019-11-06 19:43:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:43:48,857 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2019-11-06 19:43:48,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 19:43:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2019-11-06 19:43:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-06 19:43:48,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:43:48,859 INFO L410 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] [2019-11-06 19:43:48,860 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:43:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:43:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash -165996833, now seen corresponding path program 1 times [2019-11-06 19:43:48,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:43:48,860 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845037498] [2019-11-06 19:43:48,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:43:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 19:43:49,102 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845037498] [2019-11-06 19:43:49,103 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791780904] [2019-11-06 19:43:49,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:43:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:43:49,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 19:43:49,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:43:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 19:43:49,487 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 19:43:49,487 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2019-11-06 19:43:49,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092850743] [2019-11-06 19:43:49,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:43:49,490 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:43:49,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:43:49,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:43:49,492 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 6 states. [2019-11-06 19:43:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:43:49,649 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2019-11-06 19:43:49,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:43:49,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-11-06 19:43:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:43:49,651 INFO L225 Difference]: With dead ends: 138 [2019-11-06 19:43:49,652 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 19:43:49,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:43:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 19:43:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 19:43:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 19:43:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 19:43:49,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2019-11-06 19:43:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:43:49,654 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 19:43:49,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:43:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 19:43:49,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 19:43:49,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:43:49,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 19:43:50,711 INFO L443 ceAbstractionStarter]: For program point L4992-2(lines 4989 4998) no Hoare annotation was computed. [2019-11-06 19:43:50,711 INFO L443 ceAbstractionStarter]: For program point L4992(lines 4992 4995) no Hoare annotation was computed. [2019-11-06 19:43:50,711 INFO L443 ceAbstractionStarter]: For program point ldv_module_getEXIT(lines 4989 4998) no Hoare annotation was computed. [2019-11-06 19:43:50,711 INFO L443 ceAbstractionStarter]: For program point ldv_module_getENTRY(lines 4989 4998) no Hoare annotation was computed. [2019-11-06 19:43:50,711 INFO L443 ceAbstractionStarter]: For program point kfreeEXIT(lines 5118 5120) no Hoare annotation was computed. [2019-11-06 19:43:50,712 INFO L443 ceAbstractionStarter]: For program point kfreeENTRY(lines 5118 5120) no Hoare annotation was computed. [2019-11-06 19:43:50,712 INFO L443 ceAbstractionStarter]: For program point kfreeFINAL(lines 5118 5120) no Hoare annotation was computed. [2019-11-06 19:43:50,712 INFO L443 ceAbstractionStarter]: For program point might_faultFINAL(lines 5093 5095) no Hoare annotation was computed. [2019-11-06 19:43:50,712 INFO L443 ceAbstractionStarter]: For program point might_faultEXIT(lines 5093 5095) no Hoare annotation was computed. [2019-11-06 19:43:50,712 INFO L443 ceAbstractionStarter]: For program point lock_sockENTRY(lines 4708 4716) no Hoare annotation was computed. [2019-11-06 19:43:50,712 INFO L443 ceAbstractionStarter]: For program point lock_sockFINAL(lines 4708 4716) no Hoare annotation was computed. [2019-11-06 19:43:50,712 INFO L443 ceAbstractionStarter]: For program point L4712(line 4712) no Hoare annotation was computed. [2019-11-06 19:43:50,712 INFO L443 ceAbstractionStarter]: For program point lock_sockEXIT(lines 4708 4716) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point L4788-1(lines 4783 4859) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point L4788(line 4788) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point L4797(lines 4797 4800) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point L4793(lines 4792 4853) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point pppox_ioctlFINAL(lines 4774 4860) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point L4794(lines 4794 4852) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point L4856(line 4856) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point L4786(line 4786) no Hoare annotation was computed. [2019-11-06 19:43:50,713 INFO L443 ceAbstractionStarter]: For program point L4786-1(line 4786) no Hoare annotation was computed. [2019-11-06 19:43:50,714 INFO L443 ceAbstractionStarter]: For program point L4807(lines 4807 4831) no Hoare annotation was computed. [2019-11-06 19:43:50,714 INFO L443 ceAbstractionStarter]: For program point pppox_ioctlEXIT(lines 4774 4860) no Hoare annotation was computed. [2019-11-06 19:43:50,714 INFO L443 ceAbstractionStarter]: For program point L4803(line 4803) no Hoare annotation was computed. [2019-11-06 19:43:50,714 INFO L443 ceAbstractionStarter]: For program point L4803-1(line 4803) no Hoare annotation was computed. [2019-11-06 19:43:50,714 INFO L443 ceAbstractionStarter]: For program point pppox_ioctlENTRY(lines 4774 4860) no Hoare annotation was computed. [2019-11-06 19:43:50,714 INFO L443 ceAbstractionStarter]: For program point L4832(lines 4794 4851) no Hoare annotation was computed. [2019-11-06 19:43:50,714 INFO L443 ceAbstractionStarter]: For program point L4791(lines 4790 4853) no Hoare annotation was computed. [2019-11-06 19:43:50,714 INFO L443 ceAbstractionStarter]: For program point L4845(line 4845) no Hoare annotation was computed. [2019-11-06 19:43:50,715 INFO L443 ceAbstractionStarter]: For program point L4845-1(line 4845) no Hoare annotation was computed. [2019-11-06 19:43:50,715 INFO L443 ceAbstractionStarter]: For program point L4841(lines 4841 4850) no Hoare annotation was computed. [2019-11-06 19:43:50,715 INFO L443 ceAbstractionStarter]: For program point L4804-1(line 4804) no Hoare annotation was computed. [2019-11-06 19:43:50,715 INFO L443 ceAbstractionStarter]: For program point L4804(line 4804) no Hoare annotation was computed. [2019-11-06 19:43:50,715 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4922 4980) no Hoare annotation was computed. [2019-11-06 19:43:50,715 INFO L443 ceAbstractionStarter]: For program point L4945(lines 4945 4959) no Hoare annotation was computed. [2019-11-06 19:43:50,715 INFO L443 ceAbstractionStarter]: For program point L4976(line 4976) no Hoare annotation was computed. [2019-11-06 19:43:50,716 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4922 4980) no Hoare annotation was computed. [2019-11-06 19:43:50,716 INFO L439 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)|))) [2019-11-06 19:43:50,716 INFO L439 ceAbstractionStarter]: At program point L4966(lines 4930 4979) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-11-06 19:43:50,716 INFO L439 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)|))) [2019-11-06 19:43:50,717 INFO L439 ceAbstractionStarter]: At program point L4933(line 4933) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,717 INFO L439 ceAbstractionStarter]: At program point L4933-1(line 4933) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,717 INFO L439 ceAbstractionStarter]: At program point L4960(lines 4930 4979) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-11-06 19:43:50,717 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 4922 4980) the Hoare annotation is: (or (and (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (= ~LDV_IN_INTERRUPT~0 |old(~LDV_IN_INTERRUPT~0)|)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,717 INFO L443 ceAbstractionStarter]: For program point L4952(line 4952) no Hoare annotation was computed. [2019-11-06 19:43:50,717 INFO L439 ceAbstractionStarter]: At program point L4946(lines 4945 4959) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) [2019-11-06 19:43:50,717 INFO L443 ceAbstractionStarter]: For program point L4934(line 4934) no Hoare annotation was computed. [2019-11-06 19:43:50,718 INFO L443 ceAbstractionStarter]: For program point L4936(lines 4936 4939) no Hoare annotation was computed. [2019-11-06 19:43:50,718 INFO L443 ceAbstractionStarter]: For program point L4965(lines 4965 4969) no Hoare annotation was computed. [2019-11-06 19:43:50,718 INFO L443 ceAbstractionStarter]: For program point L5006(lines 5006 5011) no Hoare annotation was computed. [2019-11-06 19:43:50,718 INFO L439 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 4999 5016) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,718 INFO L443 ceAbstractionStarter]: For program point L5004-1(line 5004) no Hoare annotation was computed. [2019-11-06 19:43:50,718 INFO L443 ceAbstractionStarter]: For program point L5002(lines 5002 5013) no Hoare annotation was computed. [2019-11-06 19:43:50,718 INFO L439 ceAbstractionStarter]: At program point L5004(line 5004) the Hoare annotation is: (or (and (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (= ldv_try_module_get_~module.base |ldv_try_module_get_#in~module.base|) (<= (+ |ldv_try_module_get_#in~module.base| |ldv_try_module_get_#in~module.offset|) (+ (* 4294967296 (div (+ |ldv_try_module_get_#in~module.base| |ldv_try_module_get_#in~module.offset| (- 1)) 4294967296)) 4294967295)) (= ldv_try_module_get_~module.offset |ldv_try_module_get_#in~module.offset|)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,719 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 4999 5016) no Hoare annotation was computed. [2019-11-06 19:43:50,719 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 4999 5016) no Hoare annotation was computed. [2019-11-06 19:43:50,719 INFO L443 ceAbstractionStarter]: For program point lock_sock_nestedFINAL(lines 5090 5092) no Hoare annotation was computed. [2019-11-06 19:43:50,719 INFO L443 ceAbstractionStarter]: For program point lock_sock_nestedENTRY(lines 5090 5092) no Hoare annotation was computed. [2019-11-06 19:43:50,719 INFO L443 ceAbstractionStarter]: For program point lock_sock_nestedEXIT(lines 5090 5092) no Hoare annotation was computed. [2019-11-06 19:43:50,719 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~int~X~int~TO~intENTRY(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,719 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~int~X~int~TO~intFINAL(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,719 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~int~X~int~TO~intEXIT(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,720 INFO L446 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 5110 5112) the Hoare annotation is: true [2019-11-06 19:43:50,720 INFO L443 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 5110 5112) no Hoare annotation was computed. [2019-11-06 19:43:50,720 INFO L443 ceAbstractionStarter]: For program point sock_unregisterFINAL(lines 5110 5112) no Hoare annotation was computed. [2019-11-06 19:43:50,720 INFO L443 ceAbstractionStarter]: For program point pppox_skEXIT(lines 4718 4723) no Hoare annotation was computed. [2019-11-06 19:43:50,720 INFO L443 ceAbstractionStarter]: For program point pppox_skENTRY(lines 4718 4723) no Hoare annotation was computed. [2019-11-06 19:43:50,720 INFO L443 ceAbstractionStarter]: For program point pppox_skFINAL(lines 4718 4723) no Hoare annotation was computed. [2019-11-06 19:43:50,720 INFO L446 ceAbstractionStarter]: At program point ldv_undefined_intENTRY(lines 5087 5089) the Hoare annotation is: true [2019-11-06 19:43:50,720 INFO L443 ceAbstractionStarter]: For program point ldv_undefined_intEXIT(lines 5087 5089) no Hoare annotation was computed. [2019-11-06 19:43:50,720 INFO L443 ceAbstractionStarter]: For program point ldv_undefined_intFINAL(lines 5087 5089) no Hoare annotation was computed. [2019-11-06 19:43:50,720 INFO L443 ceAbstractionStarter]: For program point __request_moduleEXIT(lines 5080 5082) no Hoare annotation was computed. [2019-11-06 19:43:50,721 INFO L443 ceAbstractionStarter]: For program point __request_moduleENTRY(lines 5080 5082) no Hoare annotation was computed. [2019-11-06 19:43:50,721 INFO L443 ceAbstractionStarter]: For program point __request_moduleFINAL(lines 5080 5082) no Hoare annotation was computed. [2019-11-06 19:43:50,721 INFO L439 ceAbstractionStarter]: At program point L4895(lines 4864 4897) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,721 INFO L439 ceAbstractionStarter]: At program point L4893(line 4893) the Hoare annotation is: (or (and (<= ~ldv_module_refcounter~0 (+ |old(~ldv_module_refcounter~0)| 1)) (<= 2 ~ldv_module_refcounter~0) (let ((.cse4 (+ (* pppox_create_~protocol 4) |~#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) 8))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 4294967296 (div (+ .cse0 .cse1 (- 1)) 4294967296)) 4294967295))))) (<= (+ |pppox_create_#t~mem45.base| |pppox_create_#t~mem45.offset|) (+ (* 4294967296 (div (+ |pppox_create_#t~mem45.base| |pppox_create_#t~mem45.offset| (- 1)) 4294967296)) 4294967295)) (<= 1 pppox_create_~tmp~2)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,721 INFO L443 ceAbstractionStarter]: For program point L4893-1(line 4893) no Hoare annotation was computed. [2019-11-06 19:43:50,721 INFO L443 ceAbstractionStarter]: For program point pppox_createFINAL(lines 4861 4898) no Hoare annotation was computed. [2019-11-06 19:43:50,722 INFO L443 ceAbstractionStarter]: For program point L4869(lines 4869 4872) no Hoare annotation was computed. [2019-11-06 19:43:50,722 INFO L443 ceAbstractionStarter]: For program point L4892-1(line 4892) no Hoare annotation was computed. [2019-11-06 19:43:50,722 INFO L439 ceAbstractionStarter]: At program point pppox_createENTRY(lines 4861 4898) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,722 INFO L439 ceAbstractionStarter]: At program point L4892(line 4892) the Hoare annotation is: (or (and (<= ~ldv_module_refcounter~0 (+ |old(~ldv_module_refcounter~0)| 1)) (<= 2 ~ldv_module_refcounter~0) (let ((.cse4 (+ (* pppox_create_~protocol 4) |~#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) 8))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (<= (+ .cse0 .cse1) (+ (* 4294967296 (div (+ .cse0 .cse1 (- 1)) 4294967296)) 4294967295))))) (<= 1 pppox_create_~tmp~2)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,722 INFO L443 ceAbstractionStarter]: For program point L4886(lines 4886 4889) no Hoare annotation was computed. [2019-11-06 19:43:50,722 INFO L443 ceAbstractionStarter]: For program point L4884-1(line 4884) no Hoare annotation was computed. [2019-11-06 19:43:50,722 INFO L439 ceAbstractionStarter]: At program point L4884(line 4884) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (let ((.cse2 (+ (* pppox_create_~protocol 4) |~#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) 8))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) |pppox_create_#t~mem35.offset|) (= |pppox_create_#t~mem35.base| (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|))))) [2019-11-06 19:43:50,723 INFO L443 ceAbstractionStarter]: For program point L4880(lines 4880 4890) no Hoare annotation was computed. [2019-11-06 19:43:50,723 INFO L443 ceAbstractionStarter]: For program point L4874(lines 4874 4879) no Hoare annotation was computed. [2019-11-06 19:43:50,723 INFO L443 ceAbstractionStarter]: For program point pppox_createEXIT(lines 4861 4898) no Hoare annotation was computed. [2019-11-06 19:43:50,723 INFO L443 ceAbstractionStarter]: For program point L4874-2(lines 4874 4879) no Hoare annotation was computed. [2019-11-06 19:43:50,723 INFO L443 ceAbstractionStarter]: For program point L4866(lines 4866 4872) no Hoare annotation was computed. [2019-11-06 19:43:50,723 INFO L446 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 5083 5085) the Hoare annotation is: true [2019-11-06 19:43:50,723 INFO L443 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 5083 5085) no Hoare annotation was computed. [2019-11-06 19:43:50,723 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,724 INFO L446 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2019-11-06 19:43:50,724 INFO L443 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,724 INFO L443 ceAbstractionStarter]: For program point external_allocFINAL(lines 5114 5116) no Hoare annotation was computed. [2019-11-06 19:43:50,724 INFO L443 ceAbstractionStarter]: For program point external_allocEXIT(lines 5114 5116) no Hoare annotation was computed. [2019-11-06 19:43:50,724 INFO L443 ceAbstractionStarter]: For program point external_allocENTRY(lines 5114 5116) no Hoare annotation was computed. [2019-11-06 19:43:50,724 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_and_exitEXIT(lines 5033 5042) no Hoare annotation was computed. [2019-11-06 19:43:50,724 INFO L443 ceAbstractionStarter]: For program point L5037(lines 5035 5041) no Hoare annotation was computed. [2019-11-06 19:43:50,724 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_and_exitENTRY(lines 5033 5042) no Hoare annotation was computed. [2019-11-06 19:43:50,724 INFO L443 ceAbstractionStarter]: For program point unregister_pppox_protoEXIT(lines 4747 4759) no Hoare annotation was computed. [2019-11-06 19:43:50,725 INFO L443 ceAbstractionStarter]: For program point unregister_pppox_protoENTRY(lines 4747 4759) no Hoare annotation was computed. [2019-11-06 19:43:50,725 INFO L443 ceAbstractionStarter]: For program point L4751(lines 4751 4754) no Hoare annotation was computed. [2019-11-06 19:43:50,725 INFO L443 ceAbstractionStarter]: For program point L4750(lines 4750 4756) no Hoare annotation was computed. [2019-11-06 19:43:50,725 INFO L443 ceAbstractionStarter]: For program point L4750-1(lines 4747 4759) no Hoare annotation was computed. [2019-11-06 19:43:50,725 INFO L443 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 4909 4917) no Hoare annotation was computed. [2019-11-06 19:43:50,725 INFO L446 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 4909 4917) the Hoare annotation is: true [2019-11-06 19:43:50,725 INFO L443 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 4909 4917) no Hoare annotation was computed. [2019-11-06 19:43:50,725 INFO L443 ceAbstractionStarter]: For program point pppox_unbind_sockEXIT(lines 4760 4773) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point L4766(line 4766) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point pppox_unbind_sockENTRY(lines 4760 4773) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point L4763(lines 4763 4770) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point L4765(line 4765) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point L4766-1(line 4766) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point L4765-1(line 4765) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point L4763-2(lines 4760 4773) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point ldv_module_refcountFINAL(lines 5043 5048) no Hoare annotation was computed. [2019-11-06 19:43:50,726 INFO L443 ceAbstractionStarter]: For program point ldv_module_refcountENTRY(lines 5043 5048) no Hoare annotation was computed. [2019-11-06 19:43:50,727 INFO L443 ceAbstractionStarter]: For program point ldv_module_refcountEXIT(lines 5043 5048) no Hoare annotation was computed. [2019-11-06 19:43:50,727 INFO L443 ceAbstractionStarter]: For program point release_sockENTRY(lines 5103 5105) no Hoare annotation was computed. [2019-11-06 19:43:50,727 INFO L443 ceAbstractionStarter]: For program point release_sockEXIT(lines 5103 5105) no Hoare annotation was computed. [2019-11-06 19:43:50,727 INFO L443 ceAbstractionStarter]: For program point release_sockFINAL(lines 5103 5105) no Hoare annotation was computed. [2019-11-06 19:43:50,727 INFO L443 ceAbstractionStarter]: For program point L4735(lines 4735 4738) no Hoare annotation was computed. [2019-11-06 19:43:50,727 INFO L443 ceAbstractionStarter]: For program point L4732(lines 4732 4738) no Hoare annotation was computed. [2019-11-06 19:43:50,727 INFO L443 ceAbstractionStarter]: For program point register_pppox_protoEXIT(lines 4729 4746) no Hoare annotation was computed. [2019-11-06 19:43:50,727 INFO L443 ceAbstractionStarter]: For program point register_pppox_protoENTRY(lines 4729 4746) no Hoare annotation was computed. [2019-11-06 19:43:50,728 INFO L443 ceAbstractionStarter]: For program point L4739(lines 4739 4742) no Hoare annotation was computed. [2019-11-06 19:43:50,728 INFO L443 ceAbstractionStarter]: For program point register_pppox_protoFINAL(lines 4729 4746) no Hoare annotation was computed. [2019-11-06 19:43:50,728 INFO L443 ceAbstractionStarter]: For program point pppox_initFINAL(lines 4900 4908) no Hoare annotation was computed. [2019-11-06 19:43:50,728 INFO L443 ceAbstractionStarter]: For program point L4904-1(line 4904) no Hoare annotation was computed. [2019-11-06 19:43:50,728 INFO L446 ceAbstractionStarter]: At program point pppox_initENTRY(lines 4900 4908) the Hoare annotation is: true [2019-11-06 19:43:50,728 INFO L446 ceAbstractionStarter]: At program point L4904(line 4904) the Hoare annotation is: true [2019-11-06 19:43:50,728 INFO L443 ceAbstractionStarter]: For program point pppox_initEXIT(lines 4900 4908) no Hoare annotation was computed. [2019-11-06 19:43:50,728 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,729 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#pppox_protos~0.offset| |old(~#pppox_protos~0.offset)|) (= ~LDV_IN_INTERRUPT~0 |old(~LDV_IN_INTERRUPT~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string32.offset| |old(#t~string32.offset)|) (= |~#pppox_protos~0.base| |old(~#pppox_protos~0.base)|) (= |~#pppox_proto_family~0.offset| |old(~#pppox_proto_family~0.offset)|) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string32.base| |old(#t~string32.base)|) (= |old(#length)| |#length|) (= |~#pppox_proto_family~0.base| |old(~#pppox_proto_family~0.base)|)) [2019-11-06 19:43:50,729 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,729 INFO L446 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 5049 5060) the Hoare annotation is: true [2019-11-06 19:43:50,729 INFO L439 ceAbstractionStarter]: At program point L5054(line 5054) the Hoare annotation is: (not (= 1 ~ldv_module_refcounter~0)) [2019-11-06 19:43:50,729 INFO L443 ceAbstractionStarter]: For program point L5052(lines 5049 5060) no Hoare annotation was computed. [2019-11-06 19:43:50,729 INFO L443 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 5049 5060) no Hoare annotation was computed. [2019-11-06 19:43:50,729 INFO L443 ceAbstractionStarter]: For program point ppp_unregister_channelEXIT(lines 5100 5102) no Hoare annotation was computed. [2019-11-06 19:43:50,729 INFO L443 ceAbstractionStarter]: For program point ppp_unregister_channelENTRY(lines 5100 5102) no Hoare annotation was computed. [2019-11-06 19:43:50,729 INFO L443 ceAbstractionStarter]: For program point ppp_unregister_channelFINAL(lines 5100 5102) no Hoare annotation was computed. [2019-11-06 19:43:50,730 INFO L443 ceAbstractionStarter]: For program point ppp_channel_indexENTRY(lines 5097 5099) no Hoare annotation was computed. [2019-11-06 19:43:50,730 INFO L443 ceAbstractionStarter]: For program point ppp_channel_indexEXIT(lines 5097 5099) no Hoare annotation was computed. [2019-11-06 19:43:50,730 INFO L443 ceAbstractionStarter]: For program point ppp_channel_indexFINAL(lines 5097 5099) no Hoare annotation was computed. [2019-11-06 19:43:50,730 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_get_1FINAL(lines 5061 5069) no Hoare annotation was computed. [2019-11-06 19:43:50,730 INFO L443 ceAbstractionStarter]: For program point ldv_try_module_get_1EXIT(lines 5061 5069) no Hoare annotation was computed. [2019-11-06 19:43:50,730 INFO L439 ceAbstractionStarter]: At program point ldv_try_module_get_1ENTRY(lines 5061 5069) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,730 INFO L439 ceAbstractionStarter]: At program point L5065(line 5065) the Hoare annotation is: (or (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (= |ldv_try_module_get_1_#in~module.offset| ldv_try_module_get_1_~module.offset) (= ldv_try_module_get_1_~module.base |ldv_try_module_get_1_#in~module.base|))) [2019-11-06 19:43:50,730 INFO L443 ceAbstractionStarter]: For program point L5065-1(line 5065) no Hoare annotation was computed. [2019-11-06 19:43:50,731 INFO L446 ceAbstractionStarter]: At program point sock_registerENTRY(lines 5107 5109) the Hoare annotation is: true [2019-11-06 19:43:50,731 INFO L443 ceAbstractionStarter]: For program point sock_registerEXIT(lines 5107 5109) no Hoare annotation was computed. [2019-11-06 19:43:50,731 INFO L443 ceAbstractionStarter]: For program point sock_registerFINAL(lines 5107 5109) no Hoare annotation was computed. [2019-11-06 19:43:50,731 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,731 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= 1 ~ldv_module_refcounter~0) [2019-11-06 19:43:50,731 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 19:43:50,731 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 19:43:50,731 INFO L439 ceAbstractionStarter]: At program point L5023(line 5023) the Hoare annotation is: (not (<= 2 |old(~ldv_module_refcounter~0)|)) [2019-11-06 19:43:50,731 INFO L443 ceAbstractionStarter]: For program point L5020-2(lines 5017 5032) no Hoare annotation was computed. [2019-11-06 19:43:50,732 INFO L443 ceAbstractionStarter]: For program point L5021(lines 5021 5026) no Hoare annotation was computed. [2019-11-06 19:43:50,732 INFO L443 ceAbstractionStarter]: For program point L5020(lines 5020 5029) no Hoare annotation was computed. [2019-11-06 19:43:50,732 INFO L443 ceAbstractionStarter]: For program point L5021-1(lines 5021 5026) no Hoare annotation was computed. [2019-11-06 19:43:50,732 INFO L439 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 5017 5032) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,732 INFO L443 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 5017 5032) no Hoare annotation was computed. [2019-11-06 19:43:50,732 INFO L446 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4981 4986) the Hoare annotation is: true [2019-11-06 19:43:50,733 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4984) no Hoare annotation was computed. [2019-11-06 19:43:50,733 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4981 4986) no Hoare annotation was computed. [2019-11-06 19:43:50,733 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4981 4986) no Hoare annotation was computed. [2019-11-06 19:43:50,733 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_2FINAL(lines 5070 5078) no Hoare annotation was computed. [2019-11-06 19:43:50,733 INFO L443 ceAbstractionStarter]: For program point ldv_module_put_2EXIT(lines 5070 5078) no Hoare annotation was computed. [2019-11-06 19:43:50,733 INFO L439 ceAbstractionStarter]: At program point ldv_module_put_2ENTRY(lines 5070 5078) the Hoare annotation is: (or (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,733 INFO L439 ceAbstractionStarter]: At program point L5074(line 5074) the Hoare annotation is: (or (and (= |ldv_module_put_2_#in~ldv_func_arg1.offset| ldv_module_put_2_~ldv_func_arg1.offset) (= ldv_module_put_2_~ldv_func_arg1.base |ldv_module_put_2_#in~ldv_func_arg1.base|) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2019-11-06 19:43:50,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:43:50 BoogieIcfgContainer [2019-11-06 19:43:50,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 19:43:50,751 INFO L168 Benchmark]: Toolchain (without parser) took 13364.53 ms. Allocated memory was 146.3 MB in the beginning and 351.3 MB in the end (delta: 205.0 MB). Free memory was 95.8 MB in the beginning and 86.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 214.2 MB. Max. memory is 7.1 GB. [2019-11-06 19:43:50,752 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 19:43:50,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1381.71 ms. Allocated memory was 146.3 MB in the beginning and 209.7 MB in the end (delta: 63.4 MB). Free memory was 95.6 MB in the beginning and 130.0 MB in the end (delta: -34.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. [2019-11-06 19:43:50,753 INFO L168 Benchmark]: Boogie Preprocessor took 95.47 ms. Allocated memory is still 209.7 MB. Free memory was 130.0 MB in the beginning and 126.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-11-06 19:43:50,754 INFO L168 Benchmark]: RCFGBuilder took 917.94 ms. Allocated memory was 209.7 MB in the beginning and 238.6 MB in the end (delta: 28.8 MB). Free memory was 126.5 MB in the beginning and 174.4 MB in the end (delta: -47.9 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-11-06 19:43:50,755 INFO L168 Benchmark]: TraceAbstraction took 10964.85 ms. Allocated memory was 238.6 MB in the beginning and 351.3 MB in the end (delta: 112.7 MB). Free memory was 172.9 MB in the beginning and 86.6 MB in the end (delta: 86.3 MB). Peak memory consumption was 199.1 MB. Max. memory is 7.1 GB. [2019-11-06 19:43:50,758 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1381.71 ms. Allocated memory was 146.3 MB in the beginning and 209.7 MB in the end (delta: 63.4 MB). Free memory was 95.6 MB in the beginning and 130.0 MB in the end (delta: -34.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.47 ms. Allocated memory is still 209.7 MB. Free memory was 130.0 MB in the beginning and 126.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 917.94 ms. Allocated memory was 209.7 MB in the beginning and 238.6 MB in the end (delta: 28.8 MB). Free memory was 126.5 MB in the beginning and 174.4 MB in the end (delta: -47.9 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10964.85 ms. Allocated memory was 238.6 MB in the beginning and 351.3 MB in the end (delta: 112.7 MB). Free memory was 172.9 MB in the beginning and 86.6 MB in the end (delta: 86.3 MB). Peak memory consumption was 199.1 MB. Max. memory is 7.1 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)) || ldv_module_refcounter == \old(ldv_module_refcounter) - InvariantResult [Line: 4930]: Loop Invariant Derived loop invariant: !(1 == \old(ldv_module_refcounter)) || ldv_module_refcounter == \old(ldv_module_refcounter) - InvariantResult [Line: 4864]: Loop Invariant Derived loop invariant: ldv_module_refcounter == \old(ldv_module_refcounter) || !(1 == \old(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)) || ldv_module_refcounter == \old(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 35 procedures, 175 locations, 1 error locations. Result: SAFE, OverallTime: 10.8s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 646 SDtfs, 944 SDslu, 1110 SDs, 0 SdLazy, 2831 SolverSat, 419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 292 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.5s 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 DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 234 PreInvPairs, 254 NumberOfFragments, 545 HoareAnnotationTreeSize, 234 FomulaSimplifications, 3162 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 35 FomulaSimplificationsInter, 1339 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 677 NumberOfCodeBlocks, 677 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 668 ConstructedInterpolants, 0 QuantifiedInterpolants, 187489 SizeOfPredicates, 4 NumberOfNonLiveVariables, 565 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 85/88 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...