./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c9c8a757 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99a77f5372e1d3174eb539425b8da52ff3b34c76 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memtrack) --- Real Ultimate output --- This is Ultimate 0.1.24-c9c8a75 [2019-11-28 10:11:29,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:11:29,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:11:29,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:11:29,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:11:29,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:11:29,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:11:29,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:11:29,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:11:29,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:11:29,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:11:29,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:11:29,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:11:29,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:11:29,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:11:29,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:11:29,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:11:29,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:11:29,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:11:29,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:11:29,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:11:29,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:11:29,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:11:29,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:11:29,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:11:29,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:11:29,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:11:29,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:11:29,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:11:29,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:11:29,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:11:29,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:11:29,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:11:29,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:11:29,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:11:29,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:11:29,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:11:29,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:11:29,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:11:29,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:11:29,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:11:29,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 10:11:29,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:11:29,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:11:29,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:11:29,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:11:29,113 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:11:29,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:11:29,113 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:11:29,114 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:11:29,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:11:29,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:11:29,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:11:29,116 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:11:29,116 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:11:29,116 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:11:29,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:11:29,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:11:29,117 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:11:29,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:11:29,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:11:29,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:11:29,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:11:29,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:11:29,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:11:29,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:11:29,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:11:29,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 10:11:29,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 10:11:29,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99a77f5372e1d3174eb539425b8da52ff3b34c76 [2019-11-28 10:11:29,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:11:29,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:11:29,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:11:29,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:11:29,445 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:11:29,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-28 10:11:29,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc610a0c/2bd46ed30e1c48ed811c5b694618b84f/FLAGdb468a5da [2019-11-28 10:11:30,012 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:11:30,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-28 10:11:30,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc610a0c/2bd46ed30e1c48ed811c5b694618b84f/FLAGdb468a5da [2019-11-28 10:11:30,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc610a0c/2bd46ed30e1c48ed811c5b694618b84f [2019-11-28 10:11:30,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:11:30,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:11:30,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:11:30,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:11:30,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:11:30,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:30,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc4abe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30, skipping insertion in model container [2019-11-28 10:11:30,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:30,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:11:30,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:11:30,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:11:30,765 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:11:30,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:11:30,940 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:11:30,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30 WrapperNode [2019-11-28 10:11:30,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:11:30,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:11:30,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:11:30,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:11:30,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:30,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:30,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:30,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:30,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:31,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:31,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (1/1) ... [2019-11-28 10:11:31,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:11:31,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:11:31,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:11:31,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:11:31,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:11:31,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:11:31,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:11:31,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-28 10:11:31,070 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-28 10:11:31,071 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-11-28 10:11:31,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:11:31,072 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-28 10:11:31,072 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-28 10:11:31,072 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-28 10:11:31,072 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-28 10:11:31,073 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-28 10:11:31,074 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-11-28 10:11:31,074 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-11-28 10:11:31,075 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-11-28 10:11:31,075 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-11-28 10:11:31,075 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-28 10:11:31,075 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-11-28 10:11:31,078 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-28 10:11:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 10:11:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 10:11:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:11:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-28 10:11:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-11-28 10:11:31,080 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-28 10:11:31,080 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-28 10:11:31,080 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-28 10:11:31,080 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-11-28 10:11:31,081 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-11-28 10:11:31,081 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-11-28 10:11:31,081 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-11-28 10:11:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-28 10:11:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-11-28 10:11:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-28 10:11:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-28 10:11:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-28 10:11:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-28 10:11:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:11:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-28 10:11:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:11:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:11:31,406 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:11:31,469 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-28 10:11:31,469 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-28 10:11:31,489 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:11:31,623 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-28 10:11:31,624 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-28 10:11:31,625 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:11:31,682 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-28 10:11:31,683 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-28 10:11:31,697 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:11:31,749 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-28 10:11:31,749 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-28 10:11:31,858 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:11:31,882 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-28 10:11:31,883 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-28 10:11:31,913 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:11:32,021 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-11-28 10:11:32,021 INFO L710 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-11-28 10:11:32,033 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:11:32,033 INFO L297 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 10:11:32,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:11:32 BoogieIcfgContainer [2019-11-28 10:11:32,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:11:32,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:11:32,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:11:32,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:11:32,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:11:30" (1/3) ... [2019-11-28 10:11:32,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cfad35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:11:32, skipping insertion in model container [2019-11-28 10:11:32,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:30" (2/3) ... [2019-11-28 10:11:32,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cfad35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:11:32, skipping insertion in model container [2019-11-28 10:11:32,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:11:32" (3/3) ... [2019-11-28 10:11:32,049 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-11-28 10:11:32,060 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:11:32,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 10:11:32,082 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 10:11:32,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:11:32,111 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:11:32,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:11:32,112 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:11:32,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:11:32,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:11:32,113 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:11:32,113 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:11:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2019-11-28 10:11:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 10:11:32,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:32,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:32,153 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:32,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:32,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1129426977, now seen corresponding path program 1 times [2019-11-28 10:11:32,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:32,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783744887] [2019-11-28 10:11:32,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:32,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783744887] [2019-11-28 10:11:32,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:32,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 10:11:32,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906468279] [2019-11-28 10:11:32,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:11:32,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:11:32,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:11:32,622 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 5 states. [2019-11-28 10:11:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:33,714 INFO L93 Difference]: Finished difference Result 269 states and 386 transitions. [2019-11-28 10:11:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:11:33,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-28 10:11:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:33,747 INFO L225 Difference]: With dead ends: 269 [2019-11-28 10:11:33,747 INFO L226 Difference]: Without dead ends: 259 [2019-11-28 10:11:33,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:11:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-28 10:11:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2019-11-28 10:11:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-28 10:11:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2019-11-28 10:11:33,821 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2019-11-28 10:11:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:33,823 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2019-11-28 10:11:33,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:11:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2019-11-28 10:11:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 10:11:33,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:33,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:33,825 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1811427322, now seen corresponding path program 1 times [2019-11-28 10:11:33,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:33,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718011782] [2019-11-28 10:11:33,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:34,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718011782] [2019-11-28 10:11:34,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:34,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:11:34,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095669445] [2019-11-28 10:11:34,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:11:34,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:11:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:11:34,152 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 6 states. [2019-11-28 10:11:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:34,949 INFO L93 Difference]: Finished difference Result 350 states and 478 transitions. [2019-11-28 10:11:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:11:34,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 10:11:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:34,955 INFO L225 Difference]: With dead ends: 350 [2019-11-28 10:11:34,955 INFO L226 Difference]: Without dead ends: 349 [2019-11-28 10:11:34,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-28 10:11:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 304. [2019-11-28 10:11:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-28 10:11:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2019-11-28 10:11:34,984 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 28 [2019-11-28 10:11:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:34,985 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2019-11-28 10:11:34,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:11:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2019-11-28 10:11:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 10:11:34,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:34,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:34,987 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 439620198, now seen corresponding path program 1 times [2019-11-28 10:11:34,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:34,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567340727] [2019-11-28 10:11:34,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:35,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567340727] [2019-11-28 10:11:35,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:35,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:11:35,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9174538] [2019-11-28 10:11:35,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:11:35,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:11:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:11:35,153 INFO L87 Difference]: Start difference. First operand 304 states and 415 transitions. Second operand 6 states. [2019-11-28 10:11:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:35,979 INFO L93 Difference]: Finished difference Result 368 states and 494 transitions. [2019-11-28 10:11:35,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:11:35,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 10:11:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:35,983 INFO L225 Difference]: With dead ends: 368 [2019-11-28 10:11:35,983 INFO L226 Difference]: Without dead ends: 368 [2019-11-28 10:11:35,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-28 10:11:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2019-11-28 10:11:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-28 10:11:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 466 transitions. [2019-11-28 10:11:36,009 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 466 transitions. Word has length 28 [2019-11-28 10:11:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:36,009 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 466 transitions. [2019-11-28 10:11:36,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:11:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 466 transitions. [2019-11-28 10:11:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 10:11:36,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:36,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:36,016 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1607848921, now seen corresponding path program 1 times [2019-11-28 10:11:36,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:36,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931633809] [2019-11-28 10:11:36,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:36,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931633809] [2019-11-28 10:11:36,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:36,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:11:36,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596087890] [2019-11-28 10:11:36,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:11:36,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:36,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:11:36,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:11:36,206 INFO L87 Difference]: Start difference. First operand 344 states and 466 transitions. Second operand 6 states. [2019-11-28 10:11:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:37,097 INFO L93 Difference]: Finished difference Result 343 states and 463 transitions. [2019-11-28 10:11:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:11:37,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-28 10:11:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:37,101 INFO L225 Difference]: With dead ends: 343 [2019-11-28 10:11:37,102 INFO L226 Difference]: Without dead ends: 343 [2019-11-28 10:11:37,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:11:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-28 10:11:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-11-28 10:11:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-28 10:11:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2019-11-28 10:11:37,120 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 38 [2019-11-28 10:11:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:37,120 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2019-11-28 10:11:37,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:11:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2019-11-28 10:11:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 10:11:37,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:37,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:37,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:37,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1742109340, now seen corresponding path program 1 times [2019-11-28 10:11:37,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:37,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030533050] [2019-11-28 10:11:37,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:37,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030533050] [2019-11-28 10:11:37,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:37,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 10:11:37,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596884055] [2019-11-28 10:11:37,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:37,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:37,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:37,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:37,296 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand 8 states. [2019-11-28 10:11:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:38,469 INFO L93 Difference]: Finished difference Result 325 states and 431 transitions. [2019-11-28 10:11:38,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:11:38,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-28 10:11:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:38,473 INFO L225 Difference]: With dead ends: 325 [2019-11-28 10:11:38,473 INFO L226 Difference]: Without dead ends: 325 [2019-11-28 10:11:38,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:11:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-28 10:11:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 304. [2019-11-28 10:11:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-28 10:11:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 406 transitions. [2019-11-28 10:11:38,487 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 406 transitions. Word has length 46 [2019-11-28 10:11:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:38,488 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 406 transitions. [2019-11-28 10:11:38,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 406 transitions. [2019-11-28 10:11:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 10:11:38,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:38,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:38,492 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash 750041855, now seen corresponding path program 1 times [2019-11-28 10:11:38,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:38,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102987714] [2019-11-28 10:11:38,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:38,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102987714] [2019-11-28 10:11:38,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:38,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 10:11:38,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287143283] [2019-11-28 10:11:38,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:38,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:38,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:38,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:38,731 INFO L87 Difference]: Start difference. First operand 304 states and 406 transitions. Second operand 8 states. [2019-11-28 10:11:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:39,584 INFO L93 Difference]: Finished difference Result 300 states and 399 transitions. [2019-11-28 10:11:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:11:39,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-28 10:11:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:39,589 INFO L225 Difference]: With dead ends: 300 [2019-11-28 10:11:39,589 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 10:11:39,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:11:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 10:11:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 270. [2019-11-28 10:11:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-28 10:11:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2019-11-28 10:11:39,602 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 364 transitions. Word has length 45 [2019-11-28 10:11:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:39,602 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-11-28 10:11:39,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2019-11-28 10:11:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 10:11:39,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:39,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:39,606 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:39,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:39,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1784783245, now seen corresponding path program 1 times [2019-11-28 10:11:39,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:39,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824153280] [2019-11-28 10:11:39,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:39,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824153280] [2019-11-28 10:11:39,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:39,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 10:11:39,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19121894] [2019-11-28 10:11:39,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:39,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:39,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:39,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:39,811 INFO L87 Difference]: Start difference. First operand 270 states and 364 transitions. Second operand 8 states. [2019-11-28 10:11:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:40,750 INFO L93 Difference]: Finished difference Result 286 states and 381 transitions. [2019-11-28 10:11:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:11:40,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-28 10:11:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:40,752 INFO L225 Difference]: With dead ends: 286 [2019-11-28 10:11:40,752 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 10:11:40,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:11:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 10:11:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 10:11:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 10:11:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2019-11-28 10:11:40,761 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 46 [2019-11-28 10:11:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:40,762 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-11-28 10:11:40,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2019-11-28 10:11:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:11:40,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:40,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:40,764 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1852297644, now seen corresponding path program 1 times [2019-11-28 10:11:40,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:40,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102766364] [2019-11-28 10:11:40,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:40,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102766364] [2019-11-28 10:11:40,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:40,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 10:11:40,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081639902] [2019-11-28 10:11:40,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:40,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:40,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:40,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:40,918 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand 8 states. [2019-11-28 10:11:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:41,534 INFO L93 Difference]: Finished difference Result 240 states and 317 transitions. [2019-11-28 10:11:41,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 10:11:41,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-28 10:11:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:41,537 INFO L225 Difference]: With dead ends: 240 [2019-11-28 10:11:41,538 INFO L226 Difference]: Without dead ends: 240 [2019-11-28 10:11:41,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:11:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-28 10:11:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-11-28 10:11:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-28 10:11:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2019-11-28 10:11:41,546 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2019-11-28 10:11:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:41,547 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2019-11-28 10:11:41,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2019-11-28 10:11:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 10:11:41,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:41,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:41,549 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1745163498, now seen corresponding path program 1 times [2019-11-28 10:11:41,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:41,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902773332] [2019-11-28 10:11:41,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:41,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902773332] [2019-11-28 10:11:41,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:41,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 10:11:41,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649977310] [2019-11-28 10:11:41,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:11:41,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:11:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:11:41,769 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand 12 states. [2019-11-28 10:11:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:43,067 INFO L93 Difference]: Finished difference Result 249 states and 326 transitions. [2019-11-28 10:11:43,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 10:11:43,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-28 10:11:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:43,069 INFO L225 Difference]: With dead ends: 249 [2019-11-28 10:11:43,070 INFO L226 Difference]: Without dead ends: 211 [2019-11-28 10:11:43,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 10:11:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-28 10:11:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-28 10:11:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-28 10:11:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2019-11-28 10:11:43,083 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 51 [2019-11-28 10:11:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:43,084 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2019-11-28 10:11:43,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:11:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2019-11-28 10:11:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 10:11:43,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:43,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:43,087 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash 143486070, now seen corresponding path program 1 times [2019-11-28 10:11:43,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:43,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209131035] [2019-11-28 10:11:43,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:43,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209131035] [2019-11-28 10:11:43,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:43,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-28 10:11:43,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470197449] [2019-11-28 10:11:43,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 10:11:43,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:43,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 10:11:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:11:43,359 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand 14 states. [2019-11-28 10:11:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:44,475 INFO L93 Difference]: Finished difference Result 224 states and 290 transitions. [2019-11-28 10:11:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:11:44,476 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-11-28 10:11:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:44,477 INFO L225 Difference]: With dead ends: 224 [2019-11-28 10:11:44,477 INFO L226 Difference]: Without dead ends: 206 [2019-11-28 10:11:44,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-28 10:11:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-28 10:11:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-11-28 10:11:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 10:11:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2019-11-28 10:11:44,497 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 52 [2019-11-28 10:11:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:44,497 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2019-11-28 10:11:44,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 10:11:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2019-11-28 10:11:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 10:11:44,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:44,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:44,499 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:44,500 INFO L82 PathProgramCache]: Analyzing trace with hash -429340253, now seen corresponding path program 1 times [2019-11-28 10:11:44,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:44,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419805423] [2019-11-28 10:11:44,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:44,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419805423] [2019-11-28 10:11:44,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:44,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-28 10:11:44,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127163994] [2019-11-28 10:11:44,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:11:44,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:11:44,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:11:44,792 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand 15 states. [2019-11-28 10:11:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:45,908 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2019-11-28 10:11:45,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:11:45,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-11-28 10:11:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:45,910 INFO L225 Difference]: With dead ends: 215 [2019-11-28 10:11:45,910 INFO L226 Difference]: Without dead ends: 204 [2019-11-28 10:11:45,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-28 10:11:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-28 10:11:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-11-28 10:11:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-28 10:11:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 266 transitions. [2019-11-28 10:11:45,917 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 266 transitions. Word has length 55 [2019-11-28 10:11:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:45,918 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 266 transitions. [2019-11-28 10:11:45,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:11:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 266 transitions. [2019-11-28 10:11:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 10:11:45,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:45,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:45,920 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1278878233, now seen corresponding path program 1 times [2019-11-28 10:11:45,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:45,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182917826] [2019-11-28 10:11:45,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:46,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182917826] [2019-11-28 10:11:46,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:46,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 10:11:46,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465861220] [2019-11-28 10:11:46,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:46,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:46,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:46,151 INFO L87 Difference]: Start difference. First operand 204 states and 266 transitions. Second operand 8 states. [2019-11-28 10:11:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:46,618 INFO L93 Difference]: Finished difference Result 205 states and 266 transitions. [2019-11-28 10:11:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:11:46,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-28 10:11:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:46,620 INFO L225 Difference]: With dead ends: 205 [2019-11-28 10:11:46,620 INFO L226 Difference]: Without dead ends: 203 [2019-11-28 10:11:46,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:11:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-28 10:11:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-11-28 10:11:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-28 10:11:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 261 transitions. [2019-11-28 10:11:46,627 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 261 transitions. Word has length 58 [2019-11-28 10:11:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:46,627 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 261 transitions. [2019-11-28 10:11:46,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 261 transitions. [2019-11-28 10:11:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 10:11:46,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:46,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:46,629 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash 85703434, now seen corresponding path program 1 times [2019-11-28 10:11:46,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:46,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730997780] [2019-11-28 10:11:46,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:46,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730997780] [2019-11-28 10:11:46,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:46,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-28 10:11:46,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000853509] [2019-11-28 10:11:46,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:11:46,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:11:46,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:11:46,892 INFO L87 Difference]: Start difference. First operand 203 states and 261 transitions. Second operand 15 states. [2019-11-28 10:11:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:47,954 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2019-11-28 10:11:47,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:11:47,955 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-11-28 10:11:47,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:47,956 INFO L225 Difference]: With dead ends: 212 [2019-11-28 10:11:47,956 INFO L226 Difference]: Without dead ends: 177 [2019-11-28 10:11:47,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-28 10:11:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-28 10:11:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-11-28 10:11:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-28 10:11:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2019-11-28 10:11:47,961 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 59 [2019-11-28 10:11:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:47,961 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2019-11-28 10:11:47,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:11:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2019-11-28 10:11:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 10:11:47,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:47,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:47,963 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:47,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:47,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1933570889, now seen corresponding path program 1 times [2019-11-28 10:11:47,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:47,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259611719] [2019-11-28 10:11:47,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:48,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259611719] [2019-11-28 10:11:48,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:48,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-28 10:11:48,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636809387] [2019-11-28 10:11:48,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:11:48,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:11:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:11:48,239 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand 15 states. [2019-11-28 10:11:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:49,069 INFO L93 Difference]: Finished difference Result 186 states and 232 transitions. [2019-11-28 10:11:49,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:11:49,070 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-11-28 10:11:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:49,071 INFO L225 Difference]: With dead ends: 186 [2019-11-28 10:11:49,071 INFO L226 Difference]: Without dead ends: 158 [2019-11-28 10:11:49,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-28 10:11:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-28 10:11:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-28 10:11:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 10:11:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2019-11-28 10:11:49,081 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 54 [2019-11-28 10:11:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:49,082 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2019-11-28 10:11:49,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:11:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2019-11-28 10:11:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:11:49,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:49,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:49,084 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:49,084 INFO L82 PathProgramCache]: Analyzing trace with hash -309007876, now seen corresponding path program 1 times [2019-11-28 10:11:49,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:49,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539484201] [2019-11-28 10:11:49,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:49,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539484201] [2019-11-28 10:11:49,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:49,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 10:11:49,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145723199] [2019-11-28 10:11:49,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 10:11:49,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:49,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 10:11:49,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 10:11:49,346 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand 13 states. [2019-11-28 10:11:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:50,389 INFO L93 Difference]: Finished difference Result 237 states and 289 transitions. [2019-11-28 10:11:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:11:50,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-11-28 10:11:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:50,391 INFO L225 Difference]: With dead ends: 237 [2019-11-28 10:11:50,391 INFO L226 Difference]: Without dead ends: 223 [2019-11-28 10:11:50,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-11-28 10:11:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-28 10:11:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 168. [2019-11-28 10:11:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-28 10:11:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2019-11-28 10:11:50,397 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 53 [2019-11-28 10:11:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:50,397 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2019-11-28 10:11:50,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 10:11:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2019-11-28 10:11:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:11:50,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:50,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:50,399 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1433722057, now seen corresponding path program 1 times [2019-11-28 10:11:50,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:50,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993159788] [2019-11-28 10:11:50,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:50,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993159788] [2019-11-28 10:11:50,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:50,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-28 10:11:50,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195019389] [2019-11-28 10:11:50,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 10:11:50,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 10:11:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:11:50,630 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand 14 states. [2019-11-28 10:11:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:51,415 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2019-11-28 10:11:51,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 10:11:51,415 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-11-28 10:11:51,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:51,417 INFO L225 Difference]: With dead ends: 181 [2019-11-28 10:11:51,417 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 10:11:51,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-28 10:11:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 10:11:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-11-28 10:11:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-28 10:11:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2019-11-28 10:11:51,424 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 53 [2019-11-28 10:11:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:51,424 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2019-11-28 10:11:51,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 10:11:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2019-11-28 10:11:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 10:11:51,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:51,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:51,426 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1317699651, now seen corresponding path program 1 times [2019-11-28 10:11:51,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:51,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361292723] [2019-11-28 10:11:51,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:51,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361292723] [2019-11-28 10:11:51,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:51,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-28 10:11:51,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251086595] [2019-11-28 10:11:51,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:11:51,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:11:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:11:51,758 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand 15 states. [2019-11-28 10:11:52,060 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-11-28 10:11:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:53,191 INFO L93 Difference]: Finished difference Result 190 states and 214 transitions. [2019-11-28 10:11:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 10:11:53,192 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-11-28 10:11:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:53,194 INFO L225 Difference]: With dead ends: 190 [2019-11-28 10:11:53,194 INFO L226 Difference]: Without dead ends: 190 [2019-11-28 10:11:53,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-11-28 10:11:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-28 10:11:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 151. [2019-11-28 10:11:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-28 10:11:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2019-11-28 10:11:53,200 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 54 [2019-11-28 10:11:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:53,200 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2019-11-28 10:11:53,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:11:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2019-11-28 10:11:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 10:11:53,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:53,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:53,202 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1204113239, now seen corresponding path program 1 times [2019-11-28 10:11:53,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:53,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439889353] [2019-11-28 10:11:53,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:53,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439889353] [2019-11-28 10:11:53,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:53,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 10:11:53,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554001594] [2019-11-28 10:11:53,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:11:53,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:11:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:11:53,425 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand 11 states. [2019-11-28 10:11:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:53,771 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2019-11-28 10:11:53,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:11:53,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-28 10:11:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:53,773 INFO L225 Difference]: With dead ends: 166 [2019-11-28 10:11:53,774 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 10:11:53,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:11:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 10:11:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2019-11-28 10:11:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-28 10:11:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2019-11-28 10:11:53,779 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 57 [2019-11-28 10:11:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:53,779 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2019-11-28 10:11:53,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:11:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2019-11-28 10:11:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 10:11:53,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:53,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:53,781 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:53,782 INFO L82 PathProgramCache]: Analyzing trace with hash -527681510, now seen corresponding path program 1 times [2019-11-28 10:11:53,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:53,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923204238] [2019-11-28 10:11:53,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:54,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923204238] [2019-11-28 10:11:54,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:54,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 10:11:54,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101796180] [2019-11-28 10:11:54,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:11:54,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:54,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:11:54,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:11:54,043 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand 11 states. [2019-11-28 10:11:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:54,532 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2019-11-28 10:11:54,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 10:11:54,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-28 10:11:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:54,534 INFO L225 Difference]: With dead ends: 157 [2019-11-28 10:11:54,534 INFO L226 Difference]: Without dead ends: 157 [2019-11-28 10:11:54,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-28 10:11:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-28 10:11:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2019-11-28 10:11:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 10:11:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2019-11-28 10:11:54,539 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 57 [2019-11-28 10:11:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:54,540 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2019-11-28 10:11:54,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:11:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2019-11-28 10:11:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 10:11:54,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:54,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:54,542 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1222442102, now seen corresponding path program 1 times [2019-11-28 10:11:54,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:54,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457368082] [2019-11-28 10:11:54,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:54,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457368082] [2019-11-28 10:11:54,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:54,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-28 10:11:54,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881036706] [2019-11-28 10:11:54,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 10:11:54,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:54,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 10:11:54,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:11:54,794 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand 14 states. [2019-11-28 10:11:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:55,996 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2019-11-28 10:11:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 10:11:55,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-28 10:11:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:56,000 INFO L225 Difference]: With dead ends: 166 [2019-11-28 10:11:56,000 INFO L226 Difference]: Without dead ends: 166 [2019-11-28 10:11:56,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-11-28 10:11:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-28 10:11:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2019-11-28 10:11:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-28 10:11:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2019-11-28 10:11:56,005 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 55 [2019-11-28 10:11:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:56,006 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2019-11-28 10:11:56,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 10:11:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2019-11-28 10:11:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 10:11:56,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:56,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:56,008 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash -639520605, now seen corresponding path program 1 times [2019-11-28 10:11:56,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:56,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079646735] [2019-11-28 10:11:56,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:56,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079646735] [2019-11-28 10:11:56,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:56,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 10:11:56,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775698586] [2019-11-28 10:11:56,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:11:56,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:11:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:11:56,229 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand 10 states. [2019-11-28 10:11:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:56,484 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-11-28 10:11:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:11:56,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-11-28 10:11:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:56,485 INFO L225 Difference]: With dead ends: 135 [2019-11-28 10:11:56,485 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 10:11:56,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:11:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 10:11:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-28 10:11:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-28 10:11:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2019-11-28 10:11:56,490 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 58 [2019-11-28 10:11:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:56,490 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2019-11-28 10:11:56,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:11:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2019-11-28 10:11:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 10:11:56,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:56,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:56,492 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:11:56,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1656625880, now seen corresponding path program 1 times [2019-11-28 10:11:56,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:56,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27293338] [2019-11-28 10:11:56,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 10:11:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 10:11:56,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 10:11:56,635 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 10:11:56,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:11:56 BoogieIcfgContainer [2019-11-28 10:11:56,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 10:11:56,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 10:11:56,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 10:11:56,792 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 10:11:56,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:11:32" (3/4) ... [2019-11-28 10:11:56,795 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 10:11:56,967 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 10:11:56,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 10:11:56,970 INFO L168 Benchmark]: Toolchain (without parser) took 26609.20 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 456.1 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -77.8 MB). Peak memory consumption was 378.3 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:56,970 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:11:56,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:56,971 INFO L168 Benchmark]: Boogie Preprocessor took 69.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:56,973 INFO L168 Benchmark]: RCFGBuilder took 1025.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:56,973 INFO L168 Benchmark]: TraceAbstraction took 24750.51 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 342.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -30.6 MB). Peak memory consumption was 311.8 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:56,974 INFO L168 Benchmark]: Witness Printer took 176.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:56,976 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 580.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1025.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24750.51 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 342.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -30.6 MB). Peak memory consumption was 311.8 MB. Max. memory is 11.5 GB. * Witness Printer took 176.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1011]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L21] int KernelMode ; [L22] int Executive ; [L23] int DevicePowerState ; [L24] int s ; [L25] int UNLOADED ; [L26] int NP ; [L27] int DC ; [L28] int SKIP1 ; [L29] int SKIP2 ; [L30] int MPR1 ; [L31] int MPR3 ; [L32] int IPC ; [L33] int pended ; [L34] int compFptr ; [L35] int compRegistered ; [L36] int lowerDriverReturn ; [L37] int setEventCalled ; [L38] int customIrp ; [L39] 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] [L292] int status ; [L293] int irp = __VERIFIER_nondet_int() ; [L294] int pirp ; [L295] int pirp__IoStatus__Status ; [L296] int irp_choice = __VERIFIER_nondet_int() ; [L297] int devobj = __VERIFIER_nondet_int() ; [L298] int __cil_tmp8 ; [L300] KernelMode = 0 [L301] Executive = 0 [L302] DevicePowerState = 1 [L303] s = 0 [L304] UNLOADED = 0 [L305] NP = 0 [L306] DC = 0 [L307] SKIP1 = 0 [L308] SKIP2 = 0 [L309] MPR1 = 0 [L310] MPR3 = 0 [L311] IPC = 0 [L312] pended = 0 [L313] compFptr = 0 [L314] compRegistered = 0 [L315] lowerDriverReturn = 0 [L316] setEventCalled = 0 [L317] customIrp = 0 [L318] myStatus = 0 [L322] status = 0 [L323] 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] [L324] 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] [L59] UNLOADED = 0 [L60] NP = 1 [L61] DC = 2 [L62] SKIP1 = 3 [L63] SKIP2 = 4 [L64] MPR1 = 5 [L65] MPR3 = 6 [L66] IPC = 7 [L67] s = UNLOADED [L68] pended = 0 [L69] compFptr = 0 [L70] compRegistered = 0 [L71] lowerDriverReturn = 0 [L72] setEventCalled = 0 [L73] 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] [L324] RET _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] [L326] COND TRUE status >= 0 [L327] s = NP [L328] customIrp = 0 [L329] setEventCalled = customIrp [L330] lowerDriverReturn = setEventCalled [L331] compRegistered = lowerDriverReturn [L332] pended = compRegistered [L333] pirp__IoStatus__Status = 0 [L334] 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] [L335] 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] [L340] 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] [L45] s = NP [L46] pended = 0 [L47] compFptr = 0 [L48] compRegistered = 0 [L49] lowerDriverReturn = 0 [L50] setEventCalled = 0 [L51] 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] [L340] RET 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] [L343] COND FALSE !(status < 0) [L347] int tmp_ndt_1; [L348] tmp_ndt_1 = __VERIFIER_nondet_int() [L349] COND FALSE !(tmp_ndt_1 == 0) [L352] int tmp_ndt_2; [L353] tmp_ndt_2 = __VERIFIER_nondet_int() [L354] COND FALSE !(tmp_ndt_2 == 1) [L357] int tmp_ndt_3; [L358] tmp_ndt_3 = __VERIFIER_nondet_int() [L359] 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] [L386] 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] [L78] int devExt ; [L79] int irpStack ; [L80] int status ; [L81] int event = __VERIFIER_nondet_int() ; [L82] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L83] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L84] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L85] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L86] int devExt__Started ; [L87] int devExt__Removed ; [L88] int devExt__SurpriseRemoved ; [L89] int Irp__IoStatus__Status ; [L90] int Irp__IoStatus__Information ; [L91] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L92] int irpSp ; [L93] int nextIrpSp ; [L94] int nextIrpSp__Control ; [L95] int irpSp___0 ; [L96] int irpSp__Context ; [L97] int irpSp__Control ; [L98] long __cil_tmp23 ; [L101] status = 0 [L102] devExt = DeviceObject__DeviceExtension [L103] 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] [L104] 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] [L107] 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] [L110] 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] [L234] 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] [L235] COND TRUE s == NP [L236] 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] [L243] Irp__CurrentLocation ++ [L244] 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] [L245] 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] [L481] int returnVal2 ; [L482] int compRetStatus ; [L483] int lcontext = __VERIFIER_nondet_int() ; [L484] 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] [L487] 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] [L500] int tmp_ndt_6; [L501] tmp_ndt_6 = __VERIFIER_nondet_int() [L502] COND FALSE !(tmp_ndt_6 == 0) [L505] int tmp_ndt_7; [L506] tmp_ndt_7 = __VERIFIER_nondet_int() [L507] 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] [L516] 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] [L526] 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] [L530] 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] [L539] COND TRUE s == SKIP1 [L540] s = SKIP2 [L541] 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] [L549] 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] [L245] RET 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] [L246] 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] [L288] 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] [L386] RET, 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] [L386] status = KbFilter_PnP(devobj, pirp) [L410] 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] [L418] 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] [L426] 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] [L427] 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] [L428] 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] [L438] 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] [L445] 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] [L450] 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] [L451] 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] [L1011] __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, 240 locations, 1 error locations. Result: UNSAFE, OverallTime: 24.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4277 SDtfs, 5252 SDslu, 7617 SDs, 0 SdLazy, 14967 SolverSat, 1164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 276 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 229147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...