./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e107441daffe219fcef86523aff14082b11c5fb6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:33:20,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:33:20,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:33:20,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:33:20,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:33:20,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:33:20,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:33:20,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:33:20,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:33:20,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:33:20,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:33:20,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:33:20,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:33:20,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:33:20,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:33:20,031 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:33:20,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:33:20,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:33:20,034 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:33:20,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:33:20,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:33:20,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:33:20,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:33:20,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:33:20,039 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:33:20,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:33:20,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:33:20,041 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:33:20,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:33:20,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:33:20,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:33:20,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:33:20,043 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:33:20,043 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:33:20,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:33:20,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:33:20,045 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 10:33:20,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:33:20,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:33:20,055 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:33:20,055 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:33:20,055 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:33:20,055 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:33:20,055 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:33:20,055 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:33:20,055 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:33:20,055 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:33:20,056 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:33:20,056 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:33:20,056 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:33:20,056 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:33:20,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:33:20,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:33:20,057 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:33:20,057 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:33:20,057 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:33:20,057 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:33:20,057 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:33:20,057 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:33:20,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:33:20,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:33:20,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:33:20,059 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:33:20,059 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e107441daffe219fcef86523aff14082b11c5fb6 [2018-11-10 10:33:20,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:33:20,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:33:20,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:33:20,090 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:33:20,090 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:33:20,090 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 10:33:20,126 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/data/97ce75b7c/1fc82f5cd64c481b88c7bdc38fc39a95/FLAG37d346986 [2018-11-10 10:33:20,540 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:33:20,540 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 10:33:20,549 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/data/97ce75b7c/1fc82f5cd64c481b88c7bdc38fc39a95/FLAG37d346986 [2018-11-10 10:33:20,561 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/data/97ce75b7c/1fc82f5cd64c481b88c7bdc38fc39a95 [2018-11-10 10:33:20,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:33:20,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:33:20,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:33:20,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:33:20,566 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:33:20,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d64a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20, skipping insertion in model container [2018-11-10 10:33:20,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:33:20,603 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:33:20,752 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:33:20,755 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:33:20,801 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:33:20,811 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:33:20,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20 WrapperNode [2018-11-10 10:33:20,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:33:20,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:33:20,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:33:20,812 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:33:20,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:33:20,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:33:20,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:33:20,873 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:33:20,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... [2018-11-10 10:33:20,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:33:20,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:33:20,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:33:20,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:33:20,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:33:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2018-11-10 10:33:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2018-11-10 10:33:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-10 10:33:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-10 10:33:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-10 10:33:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-10 10:33:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2018-11-10 10:33:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2018-11-10 10:33:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-10 10:33:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-10 10:33:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-10 10:33:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-10 10:33:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:33:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:33:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-10 10:33:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-10 10:33:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-10 10:33:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-10 10:33:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-10 10:33:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-10 10:33:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:33:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:33:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2018-11-10 10:33:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2018-11-10 10:33:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2018-11-10 10:33:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2018-11-10 10:33:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-10 10:33:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-10 10:33:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-10 10:33:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-10 10:33:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:33:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:33:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2018-11-10 10:33:20,953 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2018-11-10 10:33:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2018-11-10 10:33:20,953 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2018-11-10 10:33:21,088 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:21,089 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:21,155 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:21,155 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:21,262 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:21,262 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:21,286 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:21,286 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:21,365 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:21,365 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:21,389 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:21,389 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:21,466 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:33:21,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:33:21 BoogieIcfgContainer [2018-11-10 10:33:21,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:33:21,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:33:21,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:33:21,469 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:33:21,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:33:20" (1/3) ... [2018-11-10 10:33:21,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5336505f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:33:21, skipping insertion in model container [2018-11-10 10:33:21,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:20" (2/3) ... [2018-11-10 10:33:21,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5336505f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:33:21, skipping insertion in model container [2018-11-10 10:33:21,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:33:21" (3/3) ... [2018-11-10 10:33:21,471 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 10:33:21,477 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:33:21,483 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:33:21,493 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:33:21,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:33:21,516 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:33:21,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:33:21,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:33:21,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:33:21,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:33:21,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:33:21,517 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:33:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2018-11-10 10:33:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:33:21,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:21,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:21,541 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:21,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:21,546 INFO L82 PathProgramCache]: Analyzing trace with hash 735747967, now seen corresponding path program 1 times [2018-11-10 10:33:21,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:21,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:21,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:21,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:21,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:21,691 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:21,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:21,704 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 3 states. [2018-11-10 10:33:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:21,805 INFO L93 Difference]: Finished difference Result 390 states and 586 transitions. [2018-11-10 10:33:21,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:21,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 10:33:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:21,819 INFO L225 Difference]: With dead ends: 390 [2018-11-10 10:33:21,819 INFO L226 Difference]: Without dead ends: 231 [2018-11-10 10:33:21,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-10 10:33:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-11-10 10:33:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-10 10:33:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2018-11-10 10:33:21,868 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2018-11-10 10:33:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:21,869 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2018-11-10 10:33:21,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2018-11-10 10:33:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:33:21,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:21,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:21,870 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:21,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:21,871 INFO L82 PathProgramCache]: Analyzing trace with hash 361793658, now seen corresponding path program 1 times [2018-11-10 10:33:21,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:21,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:21,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:21,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:21,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:21,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:21,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:21,986 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:21,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:21,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:21,989 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 3 states. [2018-11-10 10:33:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:22,114 INFO L93 Difference]: Finished difference Result 375 states and 514 transitions. [2018-11-10 10:33:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:22,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 10:33:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:22,117 INFO L225 Difference]: With dead ends: 375 [2018-11-10 10:33:22,117 INFO L226 Difference]: Without dead ends: 314 [2018-11-10 10:33:22,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-10 10:33:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 298. [2018-11-10 10:33:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-10 10:33:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 408 transitions. [2018-11-10 10:33:22,142 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 408 transitions. Word has length 28 [2018-11-10 10:33:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:22,142 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 408 transitions. [2018-11-10 10:33:22,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 408 transitions. [2018-11-10 10:33:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:33:22,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:22,144 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:22,144 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:22,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1581976422, now seen corresponding path program 1 times [2018-11-10 10:33:22,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:22,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:22,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:22,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:22,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:22,205 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:22,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:22,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,206 INFO L87 Difference]: Start difference. First operand 298 states and 408 transitions. Second operand 3 states. [2018-11-10 10:33:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:22,234 INFO L93 Difference]: Finished difference Result 481 states and 640 transitions. [2018-11-10 10:33:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:22,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 10:33:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:22,237 INFO L225 Difference]: With dead ends: 481 [2018-11-10 10:33:22,237 INFO L226 Difference]: Without dead ends: 362 [2018-11-10 10:33:22,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-10 10:33:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 338. [2018-11-10 10:33:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 10:33:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 459 transitions. [2018-11-10 10:33:22,260 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 459 transitions. Word has length 28 [2018-11-10 10:33:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:22,260 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 459 transitions. [2018-11-10 10:33:22,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 459 transitions. [2018-11-10 10:33:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:33:22,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:22,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:22,262 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:22,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash 999154855, now seen corresponding path program 1 times [2018-11-10 10:33:22,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:22,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:22,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,264 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:22,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:22,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:22,316 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:22,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,317 INFO L87 Difference]: Start difference. First operand 338 states and 459 transitions. Second operand 3 states. [2018-11-10 10:33:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:22,381 INFO L93 Difference]: Finished difference Result 341 states and 461 transitions. [2018-11-10 10:33:22,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:22,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 10:33:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:22,383 INFO L225 Difference]: With dead ends: 341 [2018-11-10 10:33:22,383 INFO L226 Difference]: Without dead ends: 337 [2018-11-10 10:33:22,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-10 10:33:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-11-10 10:33:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 10:33:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 456 transitions. [2018-11-10 10:33:22,400 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 456 transitions. Word has length 38 [2018-11-10 10:33:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:22,400 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 456 transitions. [2018-11-10 10:33:22,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 456 transitions. [2018-11-10 10:33:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 10:33:22,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:22,403 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:22,403 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:22,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash -880725092, now seen corresponding path program 1 times [2018-11-10 10:33:22,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:22,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,405 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:22,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:22,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:22,449 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:22,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:22,449 INFO L87 Difference]: Start difference. First operand 337 states and 456 transitions. Second operand 4 states. [2018-11-10 10:33:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:22,533 INFO L93 Difference]: Finished difference Result 388 states and 513 transitions. [2018-11-10 10:33:22,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:22,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-10 10:33:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:22,535 INFO L225 Difference]: With dead ends: 388 [2018-11-10 10:33:22,535 INFO L226 Difference]: Without dead ends: 319 [2018-11-10 10:33:22,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-10 10:33:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2018-11-10 10:33:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-10 10:33:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2018-11-10 10:33:22,548 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 46 [2018-11-10 10:33:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:22,548 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2018-11-10 10:33:22,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2018-11-10 10:33:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:33:22,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:22,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:22,550 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:22,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:22,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1135681025, now seen corresponding path program 1 times [2018-11-10 10:33:22,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:22,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,552 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:22,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:22,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:22,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:22,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:22,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:22,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,602 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand 3 states. [2018-11-10 10:33:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:22,636 INFO L93 Difference]: Finished difference Result 310 states and 414 transitions. [2018-11-10 10:33:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:22,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-10 10:33:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:22,638 INFO L225 Difference]: With dead ends: 310 [2018-11-10 10:33:22,638 INFO L226 Difference]: Without dead ends: 294 [2018-11-10 10:33:22,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-10 10:33:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 264. [2018-11-10 10:33:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-10 10:33:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2018-11-10 10:33:22,651 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 45 [2018-11-10 10:33:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:22,652 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2018-11-10 10:33:22,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2018-11-10 10:33:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 10:33:22,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:22,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:22,653 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:22,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash -838051187, now seen corresponding path program 1 times [2018-11-10 10:33:22,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:22,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:22,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:22,706 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:22,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,707 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand 3 states. [2018-11-10 10:33:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:22,765 INFO L93 Difference]: Finished difference Result 284 states and 378 transitions. [2018-11-10 10:33:22,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:22,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-10 10:33:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:22,767 INFO L225 Difference]: With dead ends: 284 [2018-11-10 10:33:22,767 INFO L226 Difference]: Without dead ends: 242 [2018-11-10 10:33:22,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-10 10:33:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-11-10 10:33:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-10 10:33:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2018-11-10 10:33:22,776 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 46 [2018-11-10 10:33:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:22,776 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2018-11-10 10:33:22,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2018-11-10 10:33:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 10:33:22,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:22,777 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:22,777 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:22,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:22,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1801917394, now seen corresponding path program 1 times [2018-11-10 10:33:22,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:22,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:22,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:22,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:22,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:22,816 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:22,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:22,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:22,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,817 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand 3 states. [2018-11-10 10:33:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:22,865 INFO L93 Difference]: Finished difference Result 270 states and 354 transitions. [2018-11-10 10:33:22,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:22,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-10 10:33:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:22,866 INFO L225 Difference]: With dead ends: 270 [2018-11-10 10:33:22,867 INFO L226 Difference]: Without dead ends: 240 [2018-11-10 10:33:22,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-10 10:33:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-11-10 10:33:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-10 10:33:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2018-11-10 10:33:22,875 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2018-11-10 10:33:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:22,876 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2018-11-10 10:33:22,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2018-11-10 10:33:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 10:33:22,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:22,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:22,877 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:22,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1346155562, now seen corresponding path program 1 times [2018-11-10 10:33:22,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:22,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:22,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:22,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:33:22,924 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:22,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:33:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:33:22,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:33:22,924 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand 8 states. [2018-11-10 10:33:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:22,998 INFO L93 Difference]: Finished difference Result 252 states and 329 transitions. [2018-11-10 10:33:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:33:22,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-10 10:33:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:23,000 INFO L225 Difference]: With dead ends: 252 [2018-11-10 10:33:23,000 INFO L226 Difference]: Without dead ends: 211 [2018-11-10 10:33:23,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:33:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-10 10:33:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-11-10 10:33:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-10 10:33:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2018-11-10 10:33:23,008 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 51 [2018-11-10 10:33:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:23,008 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2018-11-10 10:33:23,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:33:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2018-11-10 10:33:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 10:33:23,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:23,009 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:23,009 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:23,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash -443980426, now seen corresponding path program 1 times [2018-11-10 10:33:23,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:23,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:23,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:33:23,083 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:23,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:33:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:33:23,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:33:23,083 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand 9 states. [2018-11-10 10:33:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:23,180 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2018-11-10 10:33:23,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:33:23,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-10 10:33:23,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:23,181 INFO L225 Difference]: With dead ends: 227 [2018-11-10 10:33:23,181 INFO L226 Difference]: Without dead ends: 206 [2018-11-10 10:33:23,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:33:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-10 10:33:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-11-10 10:33:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-10 10:33:23,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2018-11-10 10:33:23,188 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 52 [2018-11-10 10:33:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:23,188 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2018-11-10 10:33:23,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:33:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2018-11-10 10:33:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 10:33:23,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:23,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:23,190 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:23,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash 815225625, now seen corresponding path program 1 times [2018-11-10 10:33:23,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:23,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:23,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:23,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:23,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:23,220 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:23,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:23,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:23,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:23,221 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand 3 states. [2018-11-10 10:33:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:23,231 INFO L93 Difference]: Finished difference Result 246 states and 315 transitions. [2018-11-10 10:33:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:23,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-10 10:33:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:23,234 INFO L225 Difference]: With dead ends: 246 [2018-11-10 10:33:23,234 INFO L226 Difference]: Without dead ends: 205 [2018-11-10 10:33:23,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-10 10:33:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-11-10 10:33:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 10:33:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 265 transitions. [2018-11-10 10:33:23,240 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 265 transitions. Word has length 58 [2018-11-10 10:33:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:23,240 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 265 transitions. [2018-11-10 10:33:23,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2018-11-10 10:33:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 10:33:23,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:23,242 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:23,242 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:23,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash -169587703, now seen corresponding path program 1 times [2018-11-10 10:33:23,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:23,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:23,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:33:23,304 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:23,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:33:23,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:33:23,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:33:23,305 INFO L87 Difference]: Start difference. First operand 205 states and 265 transitions. Second operand 10 states. [2018-11-10 10:33:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:23,395 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2018-11-10 10:33:23,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:33:23,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-10 10:33:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:23,397 INFO L225 Difference]: With dead ends: 217 [2018-11-10 10:33:23,397 INFO L226 Difference]: Without dead ends: 203 [2018-11-10 10:33:23,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:33:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-10 10:33:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-11-10 10:33:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-10 10:33:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 261 transitions. [2018-11-10 10:33:23,404 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 261 transitions. Word has length 54 [2018-11-10 10:33:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:23,404 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 261 transitions. [2018-11-10 10:33:23,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:33:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 261 transitions. [2018-11-10 10:33:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 10:33:23,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:23,405 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:23,406 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:23,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1340600068, now seen corresponding path program 1 times [2018-11-10 10:33:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:23,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:23,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:23,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:33:23,442 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:23,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:33:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:33:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:33:23,442 INFO L87 Difference]: Start difference. First operand 203 states and 261 transitions. Second operand 8 states. [2018-11-10 10:33:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:23,629 INFO L93 Difference]: Finished difference Result 351 states and 434 transitions. [2018-11-10 10:33:23,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:33:23,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-10 10:33:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:23,631 INFO L225 Difference]: With dead ends: 351 [2018-11-10 10:33:23,631 INFO L226 Difference]: Without dead ends: 279 [2018-11-10 10:33:23,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:33:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-10 10:33:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 213. [2018-11-10 10:33:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-10 10:33:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 275 transitions. [2018-11-10 10:33:23,639 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 275 transitions. Word has length 53 [2018-11-10 10:33:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:23,640 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 275 transitions. [2018-11-10 10:33:23,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:33:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 275 transitions. [2018-11-10 10:33:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 10:33:23,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:23,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:23,641 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:23,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1829653047, now seen corresponding path program 1 times [2018-11-10 10:33:23,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:23,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:23,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:33:23,693 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:23,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:33:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:33:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:33:23,694 INFO L87 Difference]: Start difference. First operand 213 states and 275 transitions. Second operand 9 states. [2018-11-10 10:33:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:23,776 INFO L93 Difference]: Finished difference Result 229 states and 291 transitions. [2018-11-10 10:33:23,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:33:23,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-11-10 10:33:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:23,778 INFO L225 Difference]: With dead ends: 229 [2018-11-10 10:33:23,778 INFO L226 Difference]: Without dead ends: 191 [2018-11-10 10:33:23,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:33:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-10 10:33:23,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-11-10 10:33:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 10:33:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2018-11-10 10:33:23,784 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 53 [2018-11-10 10:33:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:23,784 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2018-11-10 10:33:23,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:33:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2018-11-10 10:33:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 10:33:23,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:23,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:23,785 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:23,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:23,786 INFO L82 PathProgramCache]: Analyzing trace with hash -596887229, now seen corresponding path program 1 times [2018-11-10 10:33:23,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:23,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:23,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:23,787 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:23,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:23,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:33:23,857 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:23,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:33:23,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:33:23,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:33:23,857 INFO L87 Difference]: Start difference. First operand 191 states and 232 transitions. Second operand 9 states. [2018-11-10 10:33:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:24,156 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2018-11-10 10:33:24,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 10:33:24,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-10 10:33:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:24,157 INFO L225 Difference]: With dead ends: 262 [2018-11-10 10:33:24,157 INFO L226 Difference]: Without dead ends: 228 [2018-11-10 10:33:24,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:33:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-10 10:33:24,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 191. [2018-11-10 10:33:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 10:33:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 230 transitions. [2018-11-10 10:33:24,166 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 230 transitions. Word has length 54 [2018-11-10 10:33:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:24,167 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 230 transitions. [2018-11-10 10:33:24,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:33:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 230 transitions. [2018-11-10 10:33:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 10:33:24,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:24,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:24,168 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:24,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash -747193813, now seen corresponding path program 1 times [2018-11-10 10:33:24,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:24,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:24,169 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:24,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:24,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:33:24,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:24,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:33:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:33:24,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:33:24,208 INFO L87 Difference]: Start difference. First operand 191 states and 230 transitions. Second operand 6 states. [2018-11-10 10:33:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:24,241 INFO L93 Difference]: Finished difference Result 235 states and 282 transitions. [2018-11-10 10:33:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:33:24,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-10 10:33:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:24,242 INFO L225 Difference]: With dead ends: 235 [2018-11-10 10:33:24,242 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 10:33:24,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:33:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 10:33:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2018-11-10 10:33:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-10 10:33:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 231 transitions. [2018-11-10 10:33:24,250 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 231 transitions. Word has length 57 [2018-11-10 10:33:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:24,251 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 231 transitions. [2018-11-10 10:33:24,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:33:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2018-11-10 10:33:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 10:33:24,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:24,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:24,252 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:24,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash -70762084, now seen corresponding path program 1 times [2018-11-10 10:33:24,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:24,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:24,253 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:24,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:24,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:33:24,299 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:24,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:33:24,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:33:24,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:33:24,299 INFO L87 Difference]: Start difference. First operand 193 states and 231 transitions. Second operand 6 states. [2018-11-10 10:33:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:24,338 INFO L93 Difference]: Finished difference Result 204 states and 243 transitions. [2018-11-10 10:33:24,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:33:24,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-10 10:33:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:24,339 INFO L225 Difference]: With dead ends: 204 [2018-11-10 10:33:24,339 INFO L226 Difference]: Without dead ends: 197 [2018-11-10 10:33:24,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:33:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-10 10:33:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-11-10 10:33:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-10 10:33:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 232 transitions. [2018-11-10 10:33:24,347 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 232 transitions. Word has length 57 [2018-11-10 10:33:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:24,347 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 232 transitions. [2018-11-10 10:33:24,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:33:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 232 transitions. [2018-11-10 10:33:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 10:33:24,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:24,348 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:24,348 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:24,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash 640079713, now seen corresponding path program 1 times [2018-11-10 10:33:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:24,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:24,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:24,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:24,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:33:24,407 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:33:24,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:33:24,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:33:24,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:33:24,408 INFO L87 Difference]: Start difference. First operand 194 states and 232 transitions. Second operand 5 states. [2018-11-10 10:33:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:24,418 INFO L93 Difference]: Finished difference Result 230 states and 273 transitions. [2018-11-10 10:33:24,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:33:24,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-10 10:33:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:24,420 INFO L225 Difference]: With dead ends: 230 [2018-11-10 10:33:24,420 INFO L226 Difference]: Without dead ends: 188 [2018-11-10 10:33:24,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:33:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-10 10:33:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-11-10 10:33:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-10 10:33:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 223 transitions. [2018-11-10 10:33:24,428 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 223 transitions. Word has length 58 [2018-11-10 10:33:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:24,428 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 223 transitions. [2018-11-10 10:33:24,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:33:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 223 transitions. [2018-11-10 10:33:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 10:33:24,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:24,429 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:24,429 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:24,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash 966352424, now seen corresponding path program 1 times [2018-11-10 10:33:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:33:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:24,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:24,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:33:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:33:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:33:24,473 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:33:24,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:33:24 BoogieIcfgContainer [2018-11-10 10:33:24,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:33:24,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:33:24,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:33:24,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:33:24,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:33:21" (3/4) ... [2018-11-10 10:33:24,540 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:33:24,613 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9129efc9-063c-4803-ae86-c9cd391b0416/bin-2019/utaipan/witness.graphml [2018-11-10 10:33:24,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:33:24,614 INFO L168 Benchmark]: Toolchain (without parser) took 4051.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 960.3 MB in the beginning and 909.6 MB in the end (delta: 50.7 MB). Peak memory consumption was 243.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:33:24,615 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:33:24,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.64 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 938.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:33:24,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:33:24,616 INFO L168 Benchmark]: Boogie Preprocessor took 38.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:33:24,616 INFO L168 Benchmark]: RCFGBuilder took 555.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:33:24,617 INFO L168 Benchmark]: TraceAbstraction took 3070.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 919.7 MB in the end (delta: 136.1 MB). Peak memory consumption was 195.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:33:24,617 INFO L168 Benchmark]: Witness Printer took 75.99 ms. Allocated memory is still 1.2 GB. Free memory was 919.7 MB in the beginning and 909.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:33:24,618 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.64 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 938.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 555.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3070.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 919.7 MB in the end (delta: 136.1 MB). Peak memory consumption was 195.4 MB. Max. memory is 11.5 GB. * Witness Printer took 75.99 ms. Allocated memory is still 1.2 GB. Free memory was 919.7 MB in the beginning and 909.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1012]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] int KernelMode ; [L23] int Executive ; [L24] int DevicePowerState ; [L25] int s ; [L26] int UNLOADED ; [L27] int NP ; [L28] int DC ; [L29] int SKIP1 ; [L30] int SKIP2 ; [L31] int MPR1 ; [L32] int MPR3 ; [L33] int IPC ; [L34] int pended ; [L35] int compFptr ; [L36] int compRegistered ; [L37] int lowerDriverReturn ; [L38] int setEventCalled ; [L39] int customIrp ; [L40] int myStatus ; VAL [\old(compFptr)=19, \old(compRegistered)=11, \old(customIrp)=14, \old(DC)=7, \old(DevicePowerState)=20, \old(Executive)=12, \old(IPC)=8, \old(KernelMode)=24, \old(lowerDriverReturn)=22, \old(MPR1)=18, \old(MPR3)=16, \old(myStatus)=21, \old(NP)=13, \old(pended)=23, \old(s)=9, \old(setEventCalled)=17, \old(SKIP1)=15, \old(SKIP2)=10, \old(UNLOADED)=6, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L293] int status ; [L294] int irp = __VERIFIER_nondet_int() ; [L295] int pirp ; [L296] int pirp__IoStatus__Status ; [L297] int irp_choice = __VERIFIER_nondet_int() ; [L298] int devobj = __VERIFIER_nondet_int() ; [L299] int __cil_tmp8 ; [L301] KernelMode = 0 [L302] Executive = 0 [L303] DevicePowerState = 1 [L304] s = 0 [L305] UNLOADED = 0 [L306] NP = 0 [L307] DC = 0 [L308] SKIP1 = 0 [L309] SKIP2 = 0 [L310] MPR1 = 0 [L311] MPR3 = 0 [L312] IPC = 0 [L313] pended = 0 [L314] compFptr = 0 [L315] compRegistered = 0 [L316] lowerDriverReturn = 0 [L317] setEventCalled = 0 [L318] customIrp = 0 [L319] myStatus = 0 [L323] status = 0 [L324] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, devobj=0, Executive=0, IPC=0, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, UNLOADED=0] [L325] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L60] UNLOADED = 0 [L61] NP = 1 [L62] DC = 2 [L63] SKIP1 = 3 [L64] SKIP2 = 4 [L65] MPR1 = 5 [L66] MPR3 = 6 [L67] IPC = 7 [L68] s = UNLOADED [L69] pended = 0 [L70] compFptr = 0 [L71] compRegistered = 0 [L72] lowerDriverReturn = 0 [L73] setEventCalled = 0 [L74] RET customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L325] _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L327] COND TRUE status >= 0 [L328] s = NP [L329] customIrp = 0 [L330] setEventCalled = customIrp [L331] lowerDriverReturn = setEventCalled [L332] compRegistered = lowerDriverReturn [L333] pended = compRegistered [L334] pirp__IoStatus__Status = 0 [L335] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L336] COND FALSE !(irp_choice == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L341] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L46] s = NP [L47] pended = 0 [L48] compFptr = 0 [L49] compRegistered = 0 [L50] lowerDriverReturn = 0 [L51] setEventCalled = 0 [L52] RET customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L341] stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L344] COND FALSE !(status < 0) [L348] int tmp_ndt_1; [L349] tmp_ndt_1 = __VERIFIER_nondet_int() [L350] COND FALSE !(tmp_ndt_1 == 0) [L353] int tmp_ndt_2; [L354] tmp_ndt_2 = __VERIFIER_nondet_int() [L355] COND FALSE !(tmp_ndt_2 == 1) [L358] int tmp_ndt_3; [L359] tmp_ndt_3 = __VERIFIER_nondet_int() [L360] COND TRUE tmp_ndt_3 == 3 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L387] CALL, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L79] int devExt ; [L80] int irpStack ; [L81] int status ; [L82] int event = __VERIFIER_nondet_int() ; [L83] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L84] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L85] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L86] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L87] int devExt__Started ; [L88] int devExt__Removed ; [L89] int devExt__SurpriseRemoved ; [L90] int Irp__IoStatus__Status ; [L91] int Irp__IoStatus__Information ; [L92] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L93] int irpSp ; [L94] int nextIrpSp ; [L95] int nextIrpSp__Control ; [L96] int irpSp___0 ; [L97] int irpSp__Context ; [L98] int irpSp__Control ; [L99] long __cil_tmp23 ; [L102] status = 0 [L103] devExt = DeviceObject__DeviceExtension [L104] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L105] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L108] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L111] COND TRUE irpStack__MinorFunction == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L235] devExt__Removed = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] COND TRUE s == NP [L237] s = SKIP1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L244] Irp__CurrentLocation ++ [L245] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L246] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L482] int returnVal2 ; [L483] int compRetStatus ; [L484] int lcontext = __VERIFIER_nondet_int() ; [L485] long long __cil_tmp7 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L488] COND FALSE !(\read(compRegistered)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L501] int tmp_ndt_6; [L502] tmp_ndt_6 = __VERIFIER_nondet_int() [L503] COND FALSE !(tmp_ndt_6 == 0) [L506] int tmp_ndt_7; [L507] tmp_ndt_7 = __VERIFIER_nondet_int() [L508] COND TRUE tmp_ndt_7 == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L517] returnVal2 = -1073741823 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L527] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L531] COND FALSE !(s == MPR1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L540] COND TRUE s == SKIP1 [L541] s = SKIP2 [L542] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L550] RET return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L246] IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] status = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L289] RET return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L387] EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KbFilter_PnP(devobj, pirp)=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L387] status = KbFilter_PnP(devobj, pirp) [L411] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L419] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L427] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L429] COND FALSE !(s != SKIP2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L439] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L446] COND FALSE !(s == DC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L451] COND TRUE status != lowerDriverReturn VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L452] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1012] __VERIFIER_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 252 locations, 1 error locations. UNSAFE Result, 3.0s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4678 SDtfs, 2081 SDslu, 11271 SDs, 0 SdLazy, 1648 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 203 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 63203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...