./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/diskperf_true-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/diskperf_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41e5db1fb04c813999b4bdd0e142b4d5440caf41 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:45:46,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:45:46,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:45:46,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:45:46,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:45:46,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:45:46,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:45:46,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:45:46,238 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:45:46,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:45:46,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:45:46,240 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:45:46,241 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:45:46,242 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:45:46,242 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:45:46,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:45:46,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:45:46,245 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:45:46,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:45:46,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:45:46,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:45:46,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:45:46,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:45:46,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:45:46,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:45:46,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:45:46,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:45:46,253 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:45:46,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:45:46,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:45:46,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:45:46,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:45:46,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:45:46,256 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:45:46,257 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:45:46,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:45:46,258 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 07:45:46,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:45:46,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:45:46,269 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:45:46,269 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:45:46,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:45:46,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:45:46,270 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:45:46,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:45:46,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:45:46,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:45:46,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:45:46,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:45:46,271 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:45:46,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:45:46,271 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:45:46,271 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:45:46,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:45:46,272 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:45:46,272 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:45:46,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:45:46,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:45:46,272 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:45:46,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:45:46,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:45:46,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:45:46,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:45:46,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:45:46,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:45:46,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:45:46,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:45:46,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41e5db1fb04c813999b4bdd0e142b4d5440caf41 [2018-11-23 07:45:46,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:45:46,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:45:46,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:45:46,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:45:46,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:45:46,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers/diskperf_true-unreach-call.i.cil.c [2018-11-23 07:45:46,351 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/data/4629e6c98/0d6ca92a462f44edb1c27d833ab55689/FLAG61a747de8 [2018-11-23 07:45:46,898 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:45:46,898 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/sv-benchmarks/c/ntdrivers/diskperf_true-unreach-call.i.cil.c [2018-11-23 07:45:46,918 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/data/4629e6c98/0d6ca92a462f44edb1c27d833ab55689/FLAG61a747de8 [2018-11-23 07:45:47,330 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/data/4629e6c98/0d6ca92a462f44edb1c27d833ab55689 [2018-11-23 07:45:47,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:45:47,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:45:47,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:45:47,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:45:47,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:45:47,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:45:47" (1/1) ... [2018-11-23 07:45:47,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb4aa10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:47, skipping insertion in model container [2018-11-23 07:45:47,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:45:47" (1/1) ... [2018-11-23 07:45:47,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:45:47,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:45:48,090 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:45:48,124 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:45:48,254 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:45:48,307 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:45:48,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48 WrapperNode [2018-11-23 07:45:48,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:45:48,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:45:48,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:45:48,308 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:45:48,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:45:48,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:45:48,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:45:48,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:45:48,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... [2018-11-23 07:45:48,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:45:48,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:45:48,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:45:48,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:45:48,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-23 07:45:48,559 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-23 07:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-23 07:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-11-23 07:45:48,559 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-11-23 07:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:45:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:45:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-23 07:45:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-23 07:45:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-11-23 07:45:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-11-23 07:45:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-11-23 07:45:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-11-23 07:45:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-23 07:45:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-23 07:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddCounters [2018-11-23 07:45:48,561 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddCounters [2018-11-23 07:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-23 07:45:48,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-23 07:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2018-11-23 07:45:48,561 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2018-11-23 07:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2018-11-23 07:45:48,561 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2018-11-23 07:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 07:45:48,561 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 07:45:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-11-23 07:45:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-11-23 07:45:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-23 07:45:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-23 07:45:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-11-23 07:45:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-11-23 07:45:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-11-23 07:45:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-11-23 07:45:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-11-23 07:45:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-11-23 07:45:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 07:45:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 07:45:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:45:48,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-11-23 07:45:48,563 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-11-23 07:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure KeQuerySystemTime [2018-11-23 07:45:48,563 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQuerySystemTime [2018-11-23 07:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:45:48,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 07:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 07:45:48,563 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 07:45:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2018-11-23 07:45:48,563 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2018-11-23 07:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 07:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 07:45:48,564 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 07:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 07:45:48,564 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 07:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-11-23 07:45:48,564 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-11-23 07:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-11-23 07:45:48,564 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-11-23 07:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:45:48,564 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfLogError [2018-11-23 07:45:48,565 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfLogError [2018-11-23 07:45:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 07:45:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryPerformanceCounter [2018-11-23 07:45:48,565 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryPerformanceCounter [2018-11-23 07:45:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-23 07:45:48,565 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-23 07:45:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-11-23 07:45:48,565 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-11-23 07:45:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2018-11-23 07:45:48,565 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2018-11-23 07:45:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 07:45:48,566 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 07:45:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-23 07:45:48,566 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-23 07:45:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-11-23 07:45:48,566 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-11-23 07:45:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-11-23 07:45:48,566 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-11-23 07:45:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 07:45:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-11-23 07:45:48,567 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-11-23 07:45:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-11-23 07:45:48,567 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-11-23 07:45:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-23 07:45:48,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-23 07:45:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2018-11-23 07:45:48,567 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2018-11-23 07:45:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:45:48,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:45:49,120 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 07:45:49,120 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 07:45:55,970 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 07:45:55,970 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 07:45:56,099 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 07:45:56,099 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 07:45:58,206 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 07:45:58,206 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 07:45:58,246 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 07:45:58,246 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 07:46:03,157 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 07:46:03,158 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 07:46:08,961 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:46:08,961 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 07:46:08,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:46:08 BoogieIcfgContainer [2018-11-23 07:46:08,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:46:08,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:46:08,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:46:08,964 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:46:08,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:45:47" (1/3) ... [2018-11-23 07:46:08,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342ebde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:46:08, skipping insertion in model container [2018-11-23 07:46:08,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:45:48" (2/3) ... [2018-11-23 07:46:08,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342ebde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:46:08, skipping insertion in model container [2018-11-23 07:46:08,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:46:08" (3/3) ... [2018-11-23 07:46:08,967 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_true-unreach-call.i.cil.c [2018-11-23 07:46:08,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:46:08,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 07:46:08,989 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 07:46:09,011 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:46:09,011 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:46:09,011 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:46:09,011 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:46:09,012 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:46:09,012 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:46:09,012 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:46:09,012 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:46:09,012 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:46:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states. [2018-11-23 07:46:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:46:09,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:09,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:09,039 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:09,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1741170979, now seen corresponding path program 1 times [2018-11-23 07:46:09,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:09,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:09,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:09,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:09,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:09,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:46:09,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 07:46:09,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:46:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:46:09,671 INFO L87 Difference]: Start difference. First operand 433 states. Second operand 2 states. [2018-11-23 07:46:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:09,728 INFO L93 Difference]: Finished difference Result 856 states and 1239 transitions. [2018-11-23 07:46:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:46:09,729 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 07:46:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:09,739 INFO L225 Difference]: With dead ends: 856 [2018-11-23 07:46:09,739 INFO L226 Difference]: Without dead ends: 425 [2018-11-23 07:46:09,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:46:09,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-11-23 07:46:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-11-23 07:46:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-23 07:46:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 564 transitions. [2018-11-23 07:46:09,795 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 564 transitions. Word has length 24 [2018-11-23 07:46:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:09,796 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 564 transitions. [2018-11-23 07:46:09,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 07:46:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 564 transitions. [2018-11-23 07:46:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:46:09,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:09,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:09,797 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:09,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 96776145, now seen corresponding path program 1 times [2018-11-23 07:46:09,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:09,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:09,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:10,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:10,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:46:10,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:46:10,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:46:10,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:10,130 INFO L87 Difference]: Start difference. First operand 425 states and 564 transitions. Second operand 3 states. [2018-11-23 07:46:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:10,232 INFO L93 Difference]: Finished difference Result 445 states and 590 transitions. [2018-11-23 07:46:10,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:46:10,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 07:46:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:10,234 INFO L225 Difference]: With dead ends: 445 [2018-11-23 07:46:10,234 INFO L226 Difference]: Without dead ends: 425 [2018-11-23 07:46:10,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-11-23 07:46:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-11-23 07:46:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-23 07:46:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 563 transitions. [2018-11-23 07:46:10,253 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 563 transitions. Word has length 26 [2018-11-23 07:46:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:10,253 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 563 transitions. [2018-11-23 07:46:10,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:46:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 563 transitions. [2018-11-23 07:46:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:46:10,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:10,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:10,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:10,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1675584416, now seen corresponding path program 1 times [2018-11-23 07:46:10,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:10,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:10,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:10,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:10,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:11,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:46:11,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:46:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:46:11,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:11,242 INFO L87 Difference]: Start difference. First operand 425 states and 563 transitions. Second operand 3 states. [2018-11-23 07:46:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:11,439 INFO L93 Difference]: Finished difference Result 971 states and 1316 transitions. [2018-11-23 07:46:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:46:11,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 07:46:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:11,443 INFO L225 Difference]: With dead ends: 971 [2018-11-23 07:46:11,443 INFO L226 Difference]: Without dead ends: 690 [2018-11-23 07:46:11,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-11-23 07:46:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 670. [2018-11-23 07:46:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-23 07:46:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 904 transitions. [2018-11-23 07:46:11,477 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 904 transitions. Word has length 31 [2018-11-23 07:46:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:11,478 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 904 transitions. [2018-11-23 07:46:11,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:46:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 904 transitions. [2018-11-23 07:46:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:46:11,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:11,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:11,480 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:11,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1076170319, now seen corresponding path program 1 times [2018-11-23 07:46:11,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:11,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:11,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:11,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:11,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:12,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:12,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:46:12,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:46:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:46:12,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:12,481 INFO L87 Difference]: Start difference. First operand 670 states and 904 transitions. Second operand 3 states. [2018-11-23 07:46:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:12,581 INFO L93 Difference]: Finished difference Result 1552 states and 2154 transitions. [2018-11-23 07:46:12,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:46:12,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-23 07:46:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:12,588 INFO L225 Difference]: With dead ends: 1552 [2018-11-23 07:46:12,588 INFO L226 Difference]: Without dead ends: 1047 [2018-11-23 07:46:12,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-11-23 07:46:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1011. [2018-11-23 07:46:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-11-23 07:46:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1398 transitions. [2018-11-23 07:46:12,630 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1398 transitions. Word has length 41 [2018-11-23 07:46:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:12,630 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 1398 transitions. [2018-11-23 07:46:12,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:46:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1398 transitions. [2018-11-23 07:46:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:46:12,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:12,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:12,632 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:12,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2112106204, now seen corresponding path program 1 times [2018-11-23 07:46:12,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:12,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:12,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:12,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:12,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:13,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:13,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:46:13,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:46:13,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:46:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:13,455 INFO L87 Difference]: Start difference. First operand 1011 states and 1398 transitions. Second operand 3 states. [2018-11-23 07:46:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:13,590 INFO L93 Difference]: Finished difference Result 1025 states and 1417 transitions. [2018-11-23 07:46:13,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:46:13,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-23 07:46:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:13,596 INFO L225 Difference]: With dead ends: 1025 [2018-11-23 07:46:13,596 INFO L226 Difference]: Without dead ends: 1021 [2018-11-23 07:46:13,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-11-23 07:46:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1020. [2018-11-23 07:46:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-11-23 07:46:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1410 transitions. [2018-11-23 07:46:13,631 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1410 transitions. Word has length 41 [2018-11-23 07:46:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:13,632 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 1410 transitions. [2018-11-23 07:46:13,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:46:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1410 transitions. [2018-11-23 07:46:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:46:13,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:13,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:13,633 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:13,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1232912666, now seen corresponding path program 1 times [2018-11-23 07:46:13,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:13,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:13,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:14,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:14,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:46:14,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:46:14,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:46:14,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:46:14,490 INFO L87 Difference]: Start difference. First operand 1020 states and 1410 transitions. Second operand 5 states. [2018-11-23 07:46:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:15,159 INFO L93 Difference]: Finished difference Result 1061 states and 1460 transitions. [2018-11-23 07:46:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:46:15,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 07:46:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:15,164 INFO L225 Difference]: With dead ends: 1061 [2018-11-23 07:46:15,164 INFO L226 Difference]: Without dead ends: 1050 [2018-11-23 07:46:15,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:46:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2018-11-23 07:46:15,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1038. [2018-11-23 07:46:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2018-11-23 07:46:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1433 transitions. [2018-11-23 07:46:15,196 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1433 transitions. Word has length 45 [2018-11-23 07:46:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:15,197 INFO L480 AbstractCegarLoop]: Abstraction has 1038 states and 1433 transitions. [2018-11-23 07:46:15,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:46:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1433 transitions. [2018-11-23 07:46:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:46:15,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:15,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:15,198 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:15,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash -871121615, now seen corresponding path program 1 times [2018-11-23 07:46:15,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:15,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:15,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:15,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:15,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:15,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:46:15,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:46:15,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:46:15,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:46:15,942 INFO L87 Difference]: Start difference. First operand 1038 states and 1433 transitions. Second operand 5 states. [2018-11-23 07:46:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:16,568 INFO L93 Difference]: Finished difference Result 1052 states and 1445 transitions. [2018-11-23 07:46:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:46:16,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-23 07:46:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:16,573 INFO L225 Difference]: With dead ends: 1052 [2018-11-23 07:46:16,573 INFO L226 Difference]: Without dead ends: 1044 [2018-11-23 07:46:16,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:46:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2018-11-23 07:46:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1038. [2018-11-23 07:46:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2018-11-23 07:46:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1432 transitions. [2018-11-23 07:46:16,615 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1432 transitions. Word has length 46 [2018-11-23 07:46:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:16,615 INFO L480 AbstractCegarLoop]: Abstraction has 1038 states and 1432 transitions. [2018-11-23 07:46:16,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:46:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1432 transitions. [2018-11-23 07:46:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 07:46:16,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:16,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:16,617 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:16,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1502670543, now seen corresponding path program 1 times [2018-11-23 07:46:16,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:16,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:16,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:16,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:17,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:17,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:46:17,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:46:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:46:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:17,377 INFO L87 Difference]: Start difference. First operand 1038 states and 1432 transitions. Second operand 3 states. [2018-11-23 07:46:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:17,464 INFO L93 Difference]: Finished difference Result 1855 states and 2605 transitions. [2018-11-23 07:46:17,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:46:17,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-23 07:46:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:17,471 INFO L225 Difference]: With dead ends: 1855 [2018-11-23 07:46:17,471 INFO L226 Difference]: Without dead ends: 1826 [2018-11-23 07:46:17,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-11-23 07:46:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1801. [2018-11-23 07:46:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2018-11-23 07:46:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2536 transitions. [2018-11-23 07:46:17,521 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2536 transitions. Word has length 47 [2018-11-23 07:46:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:17,522 INFO L480 AbstractCegarLoop]: Abstraction has 1801 states and 2536 transitions. [2018-11-23 07:46:17,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:46:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2536 transitions. [2018-11-23 07:46:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 07:46:17,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:17,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:17,523 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:17,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 669727513, now seen corresponding path program 1 times [2018-11-23 07:46:17,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:17,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:17,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:18,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:18,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:46:18,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:46:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:46:18,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:46:18,237 INFO L87 Difference]: Start difference. First operand 1801 states and 2536 transitions. Second operand 5 states. [2018-11-23 07:46:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:20,354 INFO L93 Difference]: Finished difference Result 1815 states and 2550 transitions. [2018-11-23 07:46:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:46:20,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 07:46:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:20,361 INFO L225 Difference]: With dead ends: 1815 [2018-11-23 07:46:20,362 INFO L226 Difference]: Without dead ends: 1794 [2018-11-23 07:46:20,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:46:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2018-11-23 07:46:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1794. [2018-11-23 07:46:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2018-11-23 07:46:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2527 transitions. [2018-11-23 07:46:20,434 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2527 transitions. Word has length 48 [2018-11-23 07:46:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:20,434 INFO L480 AbstractCegarLoop]: Abstraction has 1794 states and 2527 transitions. [2018-11-23 07:46:20,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:46:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2527 transitions. [2018-11-23 07:46:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:46:20,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:20,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:20,435 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:20,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:20,435 INFO L82 PathProgramCache]: Analyzing trace with hash -908445577, now seen corresponding path program 1 times [2018-11-23 07:46:20,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:20,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:20,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:20,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:20,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:21,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:21,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:46:21,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:46:21,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:46:21,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:21,585 INFO L87 Difference]: Start difference. First operand 1794 states and 2527 transitions. Second operand 3 states. [2018-11-23 07:46:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:21,926 INFO L93 Difference]: Finished difference Result 2598 states and 3782 transitions. [2018-11-23 07:46:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:46:21,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 07:46:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:21,938 INFO L225 Difference]: With dead ends: 2598 [2018-11-23 07:46:21,938 INFO L226 Difference]: Without dead ends: 2590 [2018-11-23 07:46:21,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2018-11-23 07:46:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 1946. [2018-11-23 07:46:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2018-11-23 07:46:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2752 transitions. [2018-11-23 07:46:22,029 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2752 transitions. Word has length 51 [2018-11-23 07:46:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:22,029 INFO L480 AbstractCegarLoop]: Abstraction has 1946 states and 2752 transitions. [2018-11-23 07:46:22,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:46:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2752 transitions. [2018-11-23 07:46:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 07:46:22,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:22,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:22,031 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:22,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1939442842, now seen corresponding path program 1 times [2018-11-23 07:46:22,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:22,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:22,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:22,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:22,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:46:22,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:46:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:46:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:46:22,746 INFO L87 Difference]: Start difference. First operand 1946 states and 2752 transitions. Second operand 5 states. [2018-11-23 07:46:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:23,544 INFO L93 Difference]: Finished difference Result 2602 states and 3784 transitions. [2018-11-23 07:46:23,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:46:23,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-23 07:46:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:23,552 INFO L225 Difference]: With dead ends: 2602 [2018-11-23 07:46:23,552 INFO L226 Difference]: Without dead ends: 2594 [2018-11-23 07:46:23,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:46:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2018-11-23 07:46:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 1946. [2018-11-23 07:46:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2018-11-23 07:46:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2751 transitions. [2018-11-23 07:46:23,657 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2751 transitions. Word has length 52 [2018-11-23 07:46:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:23,658 INFO L480 AbstractCegarLoop]: Abstraction has 1946 states and 2751 transitions. [2018-11-23 07:46:23,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:46:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2751 transitions. [2018-11-23 07:46:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 07:46:23,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:23,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:23,659 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:23,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:23,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1203103478, now seen corresponding path program 1 times [2018-11-23 07:46:23,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:23,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:23,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:23,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:24,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:24,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:46:24,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:46:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:46:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:46:24,380 INFO L87 Difference]: Start difference. First operand 1946 states and 2751 transitions. Second operand 6 states. [2018-11-23 07:46:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:28,547 INFO L93 Difference]: Finished difference Result 1962 states and 2767 transitions. [2018-11-23 07:46:28,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:46:28,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-11-23 07:46:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:28,557 INFO L225 Difference]: With dead ends: 1962 [2018-11-23 07:46:28,557 INFO L226 Difference]: Without dead ends: 1903 [2018-11-23 07:46:28,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:46:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2018-11-23 07:46:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1889. [2018-11-23 07:46:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2018-11-23 07:46:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2676 transitions. [2018-11-23 07:46:28,652 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2676 transitions. Word has length 52 [2018-11-23 07:46:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:28,652 INFO L480 AbstractCegarLoop]: Abstraction has 1889 states and 2676 transitions. [2018-11-23 07:46:28,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:46:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2676 transitions. [2018-11-23 07:46:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 07:46:28,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:28,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:28,653 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:28,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:28,653 INFO L82 PathProgramCache]: Analyzing trace with hash -882473277, now seen corresponding path program 1 times [2018-11-23 07:46:28,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:28,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:28,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:28,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:29,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:29,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:46:29,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:46:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:46:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:46:29,604 INFO L87 Difference]: Start difference. First operand 1889 states and 2676 transitions. Second operand 5 states. [2018-11-23 07:46:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:30,345 INFO L93 Difference]: Finished difference Result 2533 states and 3693 transitions. [2018-11-23 07:46:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:46:30,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-23 07:46:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:30,354 INFO L225 Difference]: With dead ends: 2533 [2018-11-23 07:46:30,354 INFO L226 Difference]: Without dead ends: 2529 [2018-11-23 07:46:30,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:46:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-11-23 07:46:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 1891. [2018-11-23 07:46:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-11-23 07:46:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2678 transitions. [2018-11-23 07:46:30,424 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2678 transitions. Word has length 53 [2018-11-23 07:46:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:30,425 INFO L480 AbstractCegarLoop]: Abstraction has 1891 states and 2678 transitions. [2018-11-23 07:46:30,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:46:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2678 transitions. [2018-11-23 07:46:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 07:46:30,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:30,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:30,426 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:30,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash -882196447, now seen corresponding path program 1 times [2018-11-23 07:46:30,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:30,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:30,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:30,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:30,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:31,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:31,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 07:46:31,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 07:46:31,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:46:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:46:31,193 INFO L87 Difference]: Start difference. First operand 1891 states and 2678 transitions. Second operand 8 states. [2018-11-23 07:46:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:33,662 INFO L93 Difference]: Finished difference Result 1904 states and 2691 transitions. [2018-11-23 07:46:33,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:46:33,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 07:46:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:33,670 INFO L225 Difference]: With dead ends: 1904 [2018-11-23 07:46:33,670 INFO L226 Difference]: Without dead ends: 1883 [2018-11-23 07:46:33,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:46:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-11-23 07:46:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1883. [2018-11-23 07:46:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1883 states. [2018-11-23 07:46:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2668 transitions. [2018-11-23 07:46:33,764 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2668 transitions. Word has length 53 [2018-11-23 07:46:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:33,764 INFO L480 AbstractCegarLoop]: Abstraction has 1883 states and 2668 transitions. [2018-11-23 07:46:33,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 07:46:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2668 transitions. [2018-11-23 07:46:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:46:33,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:33,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:33,766 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:33,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1478870445, now seen corresponding path program 1 times [2018-11-23 07:46:33,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:33,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:33,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:34,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:34,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 07:46:34,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 07:46:34,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:46:34,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:46:34,683 INFO L87 Difference]: Start difference. First operand 1883 states and 2668 transitions. Second operand 8 states. [2018-11-23 07:46:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:37,099 INFO L93 Difference]: Finished difference Result 1896 states and 2681 transitions. [2018-11-23 07:46:37,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:46:37,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-23 07:46:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:37,105 INFO L225 Difference]: With dead ends: 1896 [2018-11-23 07:46:37,105 INFO L226 Difference]: Without dead ends: 1875 [2018-11-23 07:46:37,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:46:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2018-11-23 07:46:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2018-11-23 07:46:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-11-23 07:46:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2658 transitions. [2018-11-23 07:46:37,195 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2658 transitions. Word has length 55 [2018-11-23 07:46:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:37,195 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 2658 transitions. [2018-11-23 07:46:37,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 07:46:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2658 transitions. [2018-11-23 07:46:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:46:37,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:37,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:37,196 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:37,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:37,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1856845587, now seen corresponding path program 1 times [2018-11-23 07:46:37,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:37,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:37,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:37,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:37,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:46:37,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 07:46:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:46:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:46:37,835 INFO L87 Difference]: Start difference. First operand 1875 states and 2658 transitions. Second operand 7 states. [2018-11-23 07:46:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:51,782 INFO L93 Difference]: Finished difference Result 3008 states and 4526 transitions. [2018-11-23 07:46:51,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 07:46:51,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-23 07:46:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:51,792 INFO L225 Difference]: With dead ends: 3008 [2018-11-23 07:46:51,792 INFO L226 Difference]: Without dead ends: 2978 [2018-11-23 07:46:51,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:46:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2018-11-23 07:46:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2808. [2018-11-23 07:46:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2018-11-23 07:46:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4247 transitions. [2018-11-23 07:46:51,902 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4247 transitions. Word has length 56 [2018-11-23 07:46:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:51,903 INFO L480 AbstractCegarLoop]: Abstraction has 2808 states and 4247 transitions. [2018-11-23 07:46:51,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 07:46:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4247 transitions. [2018-11-23 07:46:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:46:51,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:51,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:51,904 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:51,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1140135484, now seen corresponding path program 1 times [2018-11-23 07:46:51,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:51,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:51,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:52,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:52,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:46:52,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:46:52,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:46:52,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:52,609 INFO L87 Difference]: Start difference. First operand 2808 states and 4247 transitions. Second operand 3 states. [2018-11-23 07:46:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:46:52,830 INFO L93 Difference]: Finished difference Result 3876 states and 6143 transitions. [2018-11-23 07:46:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:46:52,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-23 07:46:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:46:52,846 INFO L225 Difference]: With dead ends: 3876 [2018-11-23 07:46:52,846 INFO L226 Difference]: Without dead ends: 3863 [2018-11-23 07:46:52,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:46:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2018-11-23 07:46:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3005. [2018-11-23 07:46:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2018-11-23 07:46:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 4562 transitions. [2018-11-23 07:46:53,069 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 4562 transitions. Word has length 56 [2018-11-23 07:46:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:46:53,069 INFO L480 AbstractCegarLoop]: Abstraction has 3005 states and 4562 transitions. [2018-11-23 07:46:53,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:46:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 4562 transitions. [2018-11-23 07:46:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:46:53,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:46:53,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:46:53,070 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:46:53,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:46:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1286828286, now seen corresponding path program 1 times [2018-11-23 07:46:53,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:46:53,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:46:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:53,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:46:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:46:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:46:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:46:53,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:46:53,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:46:53,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 07:46:53,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:46:53,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:46:53,736 INFO L87 Difference]: Start difference. First operand 3005 states and 4562 transitions. Second operand 7 states. [2018-11-23 07:47:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:04,189 INFO L93 Difference]: Finished difference Result 3701 states and 5827 transitions. [2018-11-23 07:47:04,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 07:47:04,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-23 07:47:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:04,202 INFO L225 Difference]: With dead ends: 3701 [2018-11-23 07:47:04,202 INFO L226 Difference]: Without dead ends: 3658 [2018-11-23 07:47:04,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:47:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2018-11-23 07:47:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 2983. [2018-11-23 07:47:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-11-23 07:47:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4531 transitions. [2018-11-23 07:47:04,347 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4531 transitions. Word has length 56 [2018-11-23 07:47:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:04,347 INFO L480 AbstractCegarLoop]: Abstraction has 2983 states and 4531 transitions. [2018-11-23 07:47:04,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 07:47:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4531 transitions. [2018-11-23 07:47:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 07:47:04,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:04,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:04,348 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:04,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash -531895367, now seen corresponding path program 1 times [2018-11-23 07:47:04,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:04,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:04,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:04,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:04,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:47:04,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:47:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:47:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:47:04,994 INFO L87 Difference]: Start difference. First operand 2983 states and 4531 transitions. Second operand 5 states. [2018-11-23 07:47:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:05,742 INFO L93 Difference]: Finished difference Result 3841 states and 6096 transitions. [2018-11-23 07:47:05,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:47:05,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-23 07:47:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:05,753 INFO L225 Difference]: With dead ends: 3841 [2018-11-23 07:47:05,753 INFO L226 Difference]: Without dead ends: 3837 [2018-11-23 07:47:05,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:47:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2018-11-23 07:47:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 2983. [2018-11-23 07:47:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-11-23 07:47:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4530 transitions. [2018-11-23 07:47:05,919 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4530 transitions. Word has length 57 [2018-11-23 07:47:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:05,919 INFO L480 AbstractCegarLoop]: Abstraction has 2983 states and 4530 transitions. [2018-11-23 07:47:05,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:47:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4530 transitions. [2018-11-23 07:47:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 07:47:05,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:05,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:05,921 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:05,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash -531618537, now seen corresponding path program 1 times [2018-11-23 07:47:05,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:05,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:05,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:05,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:05,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:06,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:06,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 07:47:06,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 07:47:06,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:47:06,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:47:06,671 INFO L87 Difference]: Start difference. First operand 2983 states and 4530 transitions. Second operand 8 states. [2018-11-23 07:47:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:09,163 INFO L93 Difference]: Finished difference Result 2995 states and 4542 transitions. [2018-11-23 07:47:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:47:09,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-23 07:47:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:09,171 INFO L225 Difference]: With dead ends: 2995 [2018-11-23 07:47:09,171 INFO L226 Difference]: Without dead ends: 2960 [2018-11-23 07:47:09,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:47:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2018-11-23 07:47:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2960. [2018-11-23 07:47:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2018-11-23 07:47:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 4504 transitions. [2018-11-23 07:47:09,293 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 4504 transitions. Word has length 57 [2018-11-23 07:47:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:09,293 INFO L480 AbstractCegarLoop]: Abstraction has 2960 states and 4504 transitions. [2018-11-23 07:47:09,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 07:47:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 4504 transitions. [2018-11-23 07:47:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:47:09,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:09,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:09,294 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:09,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash -521995059, now seen corresponding path program 1 times [2018-11-23 07:47:09,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:09,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:09,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:09,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 07:47:09,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 07:47:09,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 07:47:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 07:47:09,983 INFO L87 Difference]: Start difference. First operand 2960 states and 4504 transitions. Second operand 4 states. [2018-11-23 07:47:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:10,329 INFO L93 Difference]: Finished difference Result 3051 states and 4606 transitions. [2018-11-23 07:47:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:47:10,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-23 07:47:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:10,333 INFO L225 Difference]: With dead ends: 3051 [2018-11-23 07:47:10,333 INFO L226 Difference]: Without dead ends: 1698 [2018-11-23 07:47:10,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 07:47:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2018-11-23 07:47:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1696. [2018-11-23 07:47:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2018-11-23 07:47:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2485 transitions. [2018-11-23 07:47:10,412 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2485 transitions. Word has length 65 [2018-11-23 07:47:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:10,412 INFO L480 AbstractCegarLoop]: Abstraction has 1696 states and 2485 transitions. [2018-11-23 07:47:10,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 07:47:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2485 transitions. [2018-11-23 07:47:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 07:47:10,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:10,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:10,413 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:10,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1121460970, now seen corresponding path program 1 times [2018-11-23 07:47:10,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:10,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:10,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:10,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:11,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:11,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 07:47:11,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 07:47:11,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 07:47:11,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:47:11,106 INFO L87 Difference]: Start difference. First operand 1696 states and 2485 transitions. Second operand 10 states. [2018-11-23 07:47:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:13,634 INFO L93 Difference]: Finished difference Result 1698 states and 2486 transitions. [2018-11-23 07:47:13,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 07:47:13,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-11-23 07:47:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:13,642 INFO L225 Difference]: With dead ends: 1698 [2018-11-23 07:47:13,642 INFO L226 Difference]: Without dead ends: 1661 [2018-11-23 07:47:13,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 07:47:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2018-11-23 07:47:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1661. [2018-11-23 07:47:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2018-11-23 07:47:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2446 transitions. [2018-11-23 07:47:13,728 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2446 transitions. Word has length 63 [2018-11-23 07:47:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:13,729 INFO L480 AbstractCegarLoop]: Abstraction has 1661 states and 2446 transitions. [2018-11-23 07:47:13,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 07:47:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2446 transitions. [2018-11-23 07:47:13,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 07:47:13,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:13,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:13,730 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:13,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:13,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1605845372, now seen corresponding path program 1 times [2018-11-23 07:47:13,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:13,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:13,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:13,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:13,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:14,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:14,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:47:14,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:47:14,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:47:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:14,452 INFO L87 Difference]: Start difference. First operand 1661 states and 2446 transitions. Second operand 3 states. [2018-11-23 07:47:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:14,523 INFO L93 Difference]: Finished difference Result 2387 states and 3613 transitions. [2018-11-23 07:47:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:47:14,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-23 07:47:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:14,526 INFO L225 Difference]: With dead ends: 2387 [2018-11-23 07:47:14,526 INFO L226 Difference]: Without dead ends: 801 [2018-11-23 07:47:14,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-23 07:47:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-23 07:47:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-23 07:47:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1153 transitions. [2018-11-23 07:47:14,567 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1153 transitions. Word has length 69 [2018-11-23 07:47:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:14,567 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1153 transitions. [2018-11-23 07:47:14,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:47:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1153 transitions. [2018-11-23 07:47:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 07:47:14,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:14,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:14,568 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:14,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1523382168, now seen corresponding path program 1 times [2018-11-23 07:47:14,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:14,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:14,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:14,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:14,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:15,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:15,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:47:15,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:47:15,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:47:15,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:15,266 INFO L87 Difference]: Start difference. First operand 801 states and 1153 transitions. Second operand 3 states. [2018-11-23 07:47:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:15,346 INFO L93 Difference]: Finished difference Result 1504 states and 2207 transitions. [2018-11-23 07:47:15,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:47:15,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-23 07:47:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:15,348 INFO L225 Difference]: With dead ends: 1504 [2018-11-23 07:47:15,348 INFO L226 Difference]: Without dead ends: 800 [2018-11-23 07:47:15,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-11-23 07:47:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2018-11-23 07:47:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-11-23 07:47:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1150 transitions. [2018-11-23 07:47:15,382 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1150 transitions. Word has length 73 [2018-11-23 07:47:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:15,383 INFO L480 AbstractCegarLoop]: Abstraction has 800 states and 1150 transitions. [2018-11-23 07:47:15,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:47:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1150 transitions. [2018-11-23 07:47:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 07:47:15,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:15,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:15,384 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:15,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash -871599007, now seen corresponding path program 1 times [2018-11-23 07:47:15,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:15,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:16,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:16,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:47:16,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:47:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:47:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:47:16,044 INFO L87 Difference]: Start difference. First operand 800 states and 1150 transitions. Second operand 6 states. [2018-11-23 07:47:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:18,131 INFO L93 Difference]: Finished difference Result 1554 states and 2318 transitions. [2018-11-23 07:47:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:47:18,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 07:47:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:18,134 INFO L225 Difference]: With dead ends: 1554 [2018-11-23 07:47:18,134 INFO L226 Difference]: Without dead ends: 831 [2018-11-23 07:47:18,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:47:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-23 07:47:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 817. [2018-11-23 07:47:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-11-23 07:47:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1198 transitions. [2018-11-23 07:47:18,170 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1198 transitions. Word has length 77 [2018-11-23 07:47:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:18,170 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1198 transitions. [2018-11-23 07:47:18,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:47:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1198 transitions. [2018-11-23 07:47:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 07:47:18,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:18,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:18,171 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:18,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:18,171 INFO L82 PathProgramCache]: Analyzing trace with hash -234971401, now seen corresponding path program 1 times [2018-11-23 07:47:18,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:18,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:18,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:18,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:18,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:47:18,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:47:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:47:18,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:18,846 INFO L87 Difference]: Start difference. First operand 817 states and 1198 transitions. Second operand 3 states. [2018-11-23 07:47:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:19,008 INFO L93 Difference]: Finished difference Result 1372 states and 2058 transitions. [2018-11-23 07:47:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:47:19,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-11-23 07:47:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:19,012 INFO L225 Difference]: With dead ends: 1372 [2018-11-23 07:47:19,013 INFO L226 Difference]: Without dead ends: 1369 [2018-11-23 07:47:19,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2018-11-23 07:47:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 963. [2018-11-23 07:47:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-11-23 07:47:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1413 transitions. [2018-11-23 07:47:19,082 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1413 transitions. Word has length 78 [2018-11-23 07:47:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:19,083 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 1413 transitions. [2018-11-23 07:47:19,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:47:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1413 transitions. [2018-11-23 07:47:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 07:47:19,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:19,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:19,084 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:19,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:19,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1045756345, now seen corresponding path program 1 times [2018-11-23 07:47:19,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:19,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:19,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:19,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:19,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:19,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:19,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:47:19,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:47:19,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:47:19,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:47:19,874 INFO L87 Difference]: Start difference. First operand 963 states and 1413 transitions. Second operand 5 states. [2018-11-23 07:47:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:19,924 INFO L93 Difference]: Finished difference Result 1494 states and 2185 transitions. [2018-11-23 07:47:19,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:47:19,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-23 07:47:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:19,927 INFO L225 Difference]: With dead ends: 1494 [2018-11-23 07:47:19,927 INFO L226 Difference]: Without dead ends: 630 [2018-11-23 07:47:19,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:47:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-11-23 07:47:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 508. [2018-11-23 07:47:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-23 07:47:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 691 transitions. [2018-11-23 07:47:19,954 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 691 transitions. Word has length 97 [2018-11-23 07:47:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:19,954 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 691 transitions. [2018-11-23 07:47:19,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:47:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 691 transitions. [2018-11-23 07:47:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 07:47:19,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:19,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:19,955 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:19,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 856802862, now seen corresponding path program 1 times [2018-11-23 07:47:19,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:20,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:20,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:47:20,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:47:20,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:47:20,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:47:20,631 INFO L87 Difference]: Start difference. First operand 508 states and 691 transitions. Second operand 5 states. [2018-11-23 07:47:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:20,974 INFO L93 Difference]: Finished difference Result 931 states and 1292 transitions. [2018-11-23 07:47:20,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:47:20,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-11-23 07:47:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:20,976 INFO L225 Difference]: With dead ends: 931 [2018-11-23 07:47:20,976 INFO L226 Difference]: Without dead ends: 503 [2018-11-23 07:47:20,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:47:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-11-23 07:47:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2018-11-23 07:47:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-23 07:47:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 676 transitions. [2018-11-23 07:47:21,003 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 676 transitions. Word has length 101 [2018-11-23 07:47:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:21,003 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 676 transitions. [2018-11-23 07:47:21,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:47:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 676 transitions. [2018-11-23 07:47:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 07:47:21,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:21,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:21,003 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:21,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash 737412862, now seen corresponding path program 1 times [2018-11-23 07:47:21,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:21,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:21,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:21,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:47:21,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:47:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:47:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:21,657 INFO L87 Difference]: Start difference. First operand 503 states and 676 transitions. Second operand 3 states. [2018-11-23 07:47:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:21,693 INFO L93 Difference]: Finished difference Result 932 states and 1282 transitions. [2018-11-23 07:47:21,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:47:21,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-23 07:47:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:21,695 INFO L225 Difference]: With dead ends: 932 [2018-11-23 07:47:21,695 INFO L226 Difference]: Without dead ends: 509 [2018-11-23 07:47:21,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-11-23 07:47:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 506. [2018-11-23 07:47:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-23 07:47:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 679 transitions. [2018-11-23 07:47:21,743 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 679 transitions. Word has length 103 [2018-11-23 07:47:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:21,743 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 679 transitions. [2018-11-23 07:47:21,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:47:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 679 transitions. [2018-11-23 07:47:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 07:47:21,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:21,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:21,744 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:21,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash -273704388, now seen corresponding path program 1 times [2018-11-23 07:47:21,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:21,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:21,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:22,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:22,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:47:22,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:47:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:47:22,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:47:22,424 INFO L87 Difference]: Start difference. First operand 506 states and 679 transitions. Second operand 5 states. [2018-11-23 07:47:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:23,077 INFO L93 Difference]: Finished difference Result 1060 states and 1448 transitions. [2018-11-23 07:47:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:47:23,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-11-23 07:47:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:23,079 INFO L225 Difference]: With dead ends: 1060 [2018-11-23 07:47:23,079 INFO L226 Difference]: Without dead ends: 659 [2018-11-23 07:47:23,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:47:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-23 07:47:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 503. [2018-11-23 07:47:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-23 07:47:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 672 transitions. [2018-11-23 07:47:23,169 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 672 transitions. Word has length 103 [2018-11-23 07:47:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:23,169 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 672 transitions. [2018-11-23 07:47:23,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:47:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 672 transitions. [2018-11-23 07:47:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:47:23,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:23,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:23,170 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:23,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -354813279, now seen corresponding path program 1 times [2018-11-23 07:47:23,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:23,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:23,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:23,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:23,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:47:23,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:47:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:47:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:23,837 INFO L87 Difference]: Start difference. First operand 503 states and 672 transitions. Second operand 3 states. [2018-11-23 07:47:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:23,937 INFO L93 Difference]: Finished difference Result 1101 states and 1501 transitions. [2018-11-23 07:47:23,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:47:23,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-23 07:47:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:23,939 INFO L225 Difference]: With dead ends: 1101 [2018-11-23 07:47:23,939 INFO L226 Difference]: Without dead ends: 681 [2018-11-23 07:47:23,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:47:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-23 07:47:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 644. [2018-11-23 07:47:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-11-23 07:47:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 865 transitions. [2018-11-23 07:47:23,974 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 865 transitions. Word has length 85 [2018-11-23 07:47:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:23,974 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 865 transitions. [2018-11-23 07:47:23,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:47:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 865 transitions. [2018-11-23 07:47:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 07:47:23,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:23,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:23,975 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:23,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash -853804927, now seen corresponding path program 1 times [2018-11-23 07:47:23,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:23,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:23,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:23,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:23,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:24,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:24,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:47:24,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:47:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:47:24,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:47:24,705 INFO L87 Difference]: Start difference. First operand 644 states and 865 transitions. Second operand 6 states. [2018-11-23 07:47:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:26,779 INFO L93 Difference]: Finished difference Result 1186 states and 1618 transitions. [2018-11-23 07:47:26,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:47:26,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-23 07:47:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:26,782 INFO L225 Difference]: With dead ends: 1186 [2018-11-23 07:47:26,782 INFO L226 Difference]: Without dead ends: 644 [2018-11-23 07:47:26,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:47:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-11-23 07:47:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2018-11-23 07:47:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-11-23 07:47:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 863 transitions. [2018-11-23 07:47:26,816 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 863 transitions. Word has length 104 [2018-11-23 07:47:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:26,816 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 863 transitions. [2018-11-23 07:47:26,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:47:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 863 transitions. [2018-11-23 07:47:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 07:47:26,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:26,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:26,817 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:26,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash 248128218, now seen corresponding path program 1 times [2018-11-23 07:47:26,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:26,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:26,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:26,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:47:27,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:47:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:47:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:47:27,549 INFO L87 Difference]: Start difference. First operand 644 states and 863 transitions. Second operand 5 states. [2018-11-23 07:47:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:28,331 INFO L93 Difference]: Finished difference Result 1153 states and 1560 transitions. [2018-11-23 07:47:28,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:47:28,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2018-11-23 07:47:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:28,332 INFO L225 Difference]: With dead ends: 1153 [2018-11-23 07:47:28,332 INFO L226 Difference]: Without dead ends: 613 [2018-11-23 07:47:28,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:47:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-11-23 07:47:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 606. [2018-11-23 07:47:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-23 07:47:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 802 transitions. [2018-11-23 07:47:28,365 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 802 transitions. Word has length 114 [2018-11-23 07:47:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:28,366 INFO L480 AbstractCegarLoop]: Abstraction has 606 states and 802 transitions. [2018-11-23 07:47:28,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:47:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 802 transitions. [2018-11-23 07:47:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 07:47:28,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:28,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:28,366 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:28,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash 294896207, now seen corresponding path program 1 times [2018-11-23 07:47:28,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:28,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:28,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:28,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:28,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:29,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:29,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 07:47:29,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 07:47:29,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 07:47:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 07:47:29,152 INFO L87 Difference]: Start difference. First operand 606 states and 802 transitions. Second operand 15 states. [2018-11-23 07:47:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:47:34,141 INFO L93 Difference]: Finished difference Result 1126 states and 1492 transitions. [2018-11-23 07:47:34,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 07:47:34,142 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 124 [2018-11-23 07:47:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:47:34,144 INFO L225 Difference]: With dead ends: 1126 [2018-11-23 07:47:34,144 INFO L226 Difference]: Without dead ends: 602 [2018-11-23 07:47:34,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-23 07:47:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-23 07:47:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 594. [2018-11-23 07:47:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-23 07:47:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 779 transitions. [2018-11-23 07:47:34,180 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 779 transitions. Word has length 124 [2018-11-23 07:47:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:47:34,181 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 779 transitions. [2018-11-23 07:47:34,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 07:47:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 779 transitions. [2018-11-23 07:47:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-23 07:47:34,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:47:34,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:47:34,183 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:47:34,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:47:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash 687421676, now seen corresponding path program 1 times [2018-11-23 07:47:34,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:47:34,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:47:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:34,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:47:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:47:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:47:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:47:35,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:47:35,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 07:47:35,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 07:47:35,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 07:47:35,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:47:35,050 INFO L87 Difference]: Start difference. First operand 594 states and 779 transitions. Second operand 14 states. [2018-11-23 07:48:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:48:26,665 INFO L93 Difference]: Finished difference Result 1161 states and 1526 transitions. [2018-11-23 07:48:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 07:48:26,665 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 134 [2018-11-23 07:48:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:48:26,669 INFO L225 Difference]: With dead ends: 1161 [2018-11-23 07:48:26,669 INFO L226 Difference]: Without dead ends: 1106 [2018-11-23 07:48:26,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 07:48:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-11-23 07:48:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1100. [2018-11-23 07:48:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-11-23 07:48:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1456 transitions. [2018-11-23 07:48:26,730 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1456 transitions. Word has length 134 [2018-11-23 07:48:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:48:26,730 INFO L480 AbstractCegarLoop]: Abstraction has 1100 states and 1456 transitions. [2018-11-23 07:48:26,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 07:48:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1456 transitions. [2018-11-23 07:48:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-23 07:48:26,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:48:26,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:48:26,732 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:48:26,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:48:26,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1885542934, now seen corresponding path program 1 times [2018-11-23 07:48:26,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:48:26,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:48:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:48:26,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:48:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:48:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:48:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:48:27,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:48:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 07:48:27,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 07:48:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 07:48:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:48:27,505 INFO L87 Difference]: Start difference. First operand 1100 states and 1456 transitions. Second operand 14 states. [2018-11-23 07:49:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:49:13,016 INFO L93 Difference]: Finished difference Result 1121 states and 1475 transitions. [2018-11-23 07:49:13,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 07:49:13,016 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 134 [2018-11-23 07:49:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:49:13,018 INFO L225 Difference]: With dead ends: 1121 [2018-11-23 07:49:13,019 INFO L226 Difference]: Without dead ends: 1066 [2018-11-23 07:49:13,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-23 07:49:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-11-23 07:49:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 561. [2018-11-23 07:49:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-23 07:49:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 735 transitions. [2018-11-23 07:49:13,056 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 735 transitions. Word has length 134 [2018-11-23 07:49:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:49:13,057 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 735 transitions. [2018-11-23 07:49:13,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 07:49:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 735 transitions. [2018-11-23 07:49:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 07:49:13,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:49:13,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:49:13,058 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:49:13,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:49:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash -495040830, now seen corresponding path program 1 times [2018-11-23 07:49:13,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:49:13,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:49:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:13,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:49:13,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:49:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:49:13,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:49:13,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:49:13,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:49:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:49:13,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:49:13,860 INFO L87 Difference]: Start difference. First operand 561 states and 735 transitions. Second operand 5 states. [2018-11-23 07:49:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:49:13,913 INFO L93 Difference]: Finished difference Result 728 states and 960 transitions. [2018-11-23 07:49:13,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:49:13,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-11-23 07:49:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:49:13,915 INFO L225 Difference]: With dead ends: 728 [2018-11-23 07:49:13,915 INFO L226 Difference]: Without dead ends: 634 [2018-11-23 07:49:13,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:49:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-23 07:49:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 567. [2018-11-23 07:49:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-11-23 07:49:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 747 transitions. [2018-11-23 07:49:13,956 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 747 transitions. Word has length 137 [2018-11-23 07:49:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:49:13,957 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 747 transitions. [2018-11-23 07:49:13,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:49:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 747 transitions. [2018-11-23 07:49:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 07:49:13,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:49:13,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:49:13,958 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:49:13,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:49:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash -879906623, now seen corresponding path program 1 times [2018-11-23 07:49:13,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:49:13,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:49:13,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:13,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:49:13,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:49:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:49:14,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:49:14,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 07:49:14,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 07:49:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 07:49:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 07:49:14,793 INFO L87 Difference]: Start difference. First operand 567 states and 747 transitions. Second operand 15 states. [2018-11-23 07:49:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:49:21,099 INFO L93 Difference]: Finished difference Result 595 states and 778 transitions. [2018-11-23 07:49:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 07:49:21,100 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-11-23 07:49:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:49:21,101 INFO L225 Difference]: With dead ends: 595 [2018-11-23 07:49:21,101 INFO L226 Difference]: Without dead ends: 565 [2018-11-23 07:49:21,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-23 07:49:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-11-23 07:49:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 559. [2018-11-23 07:49:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-11-23 07:49:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 732 transitions. [2018-11-23 07:49:21,141 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 732 transitions. Word has length 137 [2018-11-23 07:49:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:49:21,142 INFO L480 AbstractCegarLoop]: Abstraction has 559 states and 732 transitions. [2018-11-23 07:49:21,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 07:49:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 732 transitions. [2018-11-23 07:49:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 07:49:21,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:49:21,143 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:49:21,143 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:49:21,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:49:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash -443508150, now seen corresponding path program 1 times [2018-11-23 07:49:21,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:49:21,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:49:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:21,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:49:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:49:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 07:49:21,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:49:21,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:49:21,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:49:21,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:49:21,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:49:21,935 INFO L87 Difference]: Start difference. First operand 559 states and 732 transitions. Second operand 5 states. [2018-11-23 07:49:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:49:22,023 INFO L93 Difference]: Finished difference Result 784 states and 1030 transitions. [2018-11-23 07:49:22,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:49:22,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2018-11-23 07:49:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:49:22,025 INFO L225 Difference]: With dead ends: 784 [2018-11-23 07:49:22,025 INFO L226 Difference]: Without dead ends: 653 [2018-11-23 07:49:22,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:49:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-23 07:49:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 553. [2018-11-23 07:49:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-11-23 07:49:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 720 transitions. [2018-11-23 07:49:22,071 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 720 transitions. Word has length 163 [2018-11-23 07:49:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:49:22,071 INFO L480 AbstractCegarLoop]: Abstraction has 553 states and 720 transitions. [2018-11-23 07:49:22,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:49:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 720 transitions. [2018-11-23 07:49:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 07:49:22,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:49:22,072 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:49:22,072 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:49:22,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:49:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1914296668, now seen corresponding path program 1 times [2018-11-23 07:49:22,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:49:22,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:49:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:22,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:49:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:49:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 07:49:22,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:49:22,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:49:22,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:49:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:49:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:49:22,856 INFO L87 Difference]: Start difference. First operand 553 states and 720 transitions. Second operand 6 states. [2018-11-23 07:49:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:49:22,958 INFO L93 Difference]: Finished difference Result 975 states and 1265 transitions. [2018-11-23 07:49:22,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:49:22,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-11-23 07:49:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:49:22,960 INFO L225 Difference]: With dead ends: 975 [2018-11-23 07:49:22,960 INFO L226 Difference]: Without dead ends: 540 [2018-11-23 07:49:22,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:49:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-11-23 07:49:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-11-23 07:49:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-23 07:49:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 697 transitions. [2018-11-23 07:49:22,995 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 697 transitions. Word has length 163 [2018-11-23 07:49:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:49:22,995 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 697 transitions. [2018-11-23 07:49:22,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:49:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 697 transitions. [2018-11-23 07:49:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 07:49:22,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:49:22,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:49:22,997 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:49:22,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:49:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash 109733572, now seen corresponding path program 1 times [2018-11-23 07:49:22,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:49:22,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:49:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:23,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:49:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:49:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:49:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:49:23,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:49:23,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 07:49:23,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 07:49:23,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 07:49:23,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:49:23,819 INFO L87 Difference]: Start difference. First operand 540 states and 697 transitions. Second operand 14 states. [2018-11-23 07:50:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:50:15,463 INFO L93 Difference]: Finished difference Result 1063 states and 1373 transitions. [2018-11-23 07:50:15,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 07:50:15,463 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2018-11-23 07:50:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:50:15,465 INFO L225 Difference]: With dead ends: 1063 [2018-11-23 07:50:15,466 INFO L226 Difference]: Without dead ends: 899 [2018-11-23 07:50:15,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 07:50:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-11-23 07:50:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 840. [2018-11-23 07:50:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-23 07:50:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1066 transitions. [2018-11-23 07:50:15,525 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1066 transitions. Word has length 147 [2018-11-23 07:50:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:50:15,525 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1066 transitions. [2018-11-23 07:50:15,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 07:50:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1066 transitions. [2018-11-23 07:50:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 07:50:15,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:50:15,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:50:15,532 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:50:15,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:50:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash -565426554, now seen corresponding path program 1 times [2018-11-23 07:50:15,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:50:15,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:50:15,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:50:15,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:50:15,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:50:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:50:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:50:16,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:50:16,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 07:50:16,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 07:50:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 07:50:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:50:16,393 INFO L87 Difference]: Start difference. First operand 840 states and 1066 transitions. Second operand 14 states. [2018-11-23 07:51:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:51:03,217 INFO L93 Difference]: Finished difference Result 849 states and 1073 transitions. [2018-11-23 07:51:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 07:51:03,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2018-11-23 07:51:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:51:03,219 INFO L225 Difference]: With dead ends: 849 [2018-11-23 07:51:03,219 INFO L226 Difference]: Without dead ends: 683 [2018-11-23 07:51:03,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-23 07:51:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-23 07:51:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 312. [2018-11-23 07:51:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-23 07:51:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 382 transitions. [2018-11-23 07:51:03,248 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 382 transitions. Word has length 147 [2018-11-23 07:51:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:51:03,248 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 382 transitions. [2018-11-23 07:51:03,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 07:51:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 382 transitions. [2018-11-23 07:51:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 07:51:03,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:51:03,249 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:51:03,249 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:51:03,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:51:03,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1872933370, now seen corresponding path program 1 times [2018-11-23 07:51:03,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:51:03,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:51:03,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:03,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:51:03,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:51:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-23 07:51:03,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:51:03,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:51:03,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:51:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:51:04,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:51:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 07:51:04,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 07:51:04,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-23 07:51:04,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 07:51:04,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:51:04,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:51:04,828 INFO L87 Difference]: Start difference. First operand 312 states and 382 transitions. Second operand 8 states. [2018-11-23 07:51:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:51:05,125 INFO L93 Difference]: Finished difference Result 631 states and 778 transitions. [2018-11-23 07:51:05,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:51:05,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 192 [2018-11-23 07:51:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:51:05,128 INFO L225 Difference]: With dead ends: 631 [2018-11-23 07:51:05,129 INFO L226 Difference]: Without dead ends: 324 [2018-11-23 07:51:05,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:51:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-23 07:51:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2018-11-23 07:51:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-11-23 07:51:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 395 transitions. [2018-11-23 07:51:05,189 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 395 transitions. Word has length 192 [2018-11-23 07:51:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:51:05,189 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 395 transitions. [2018-11-23 07:51:05,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 07:51:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 395 transitions. [2018-11-23 07:51:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-23 07:51:05,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:51:05,191 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:51:05,191 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:51:05,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:51:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1939777382, now seen corresponding path program 1 times [2018-11-23 07:51:05,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:51:05,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:51:05,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:05,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:51:05,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:51:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-23 07:51:06,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:51:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:51:06,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:51:06,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:51:06,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:51:06,236 INFO L87 Difference]: Start difference. First operand 322 states and 395 transitions. Second operand 6 states. [2018-11-23 07:51:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:51:06,402 INFO L93 Difference]: Finished difference Result 523 states and 632 transitions. [2018-11-23 07:51:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:51:06,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2018-11-23 07:51:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:51:06,405 INFO L225 Difference]: With dead ends: 523 [2018-11-23 07:51:06,405 INFO L226 Difference]: Without dead ends: 307 [2018-11-23 07:51:06,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:51:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-23 07:51:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-23 07:51:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-23 07:51:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 370 transitions. [2018-11-23 07:51:06,459 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 370 transitions. Word has length 197 [2018-11-23 07:51:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:51:06,460 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 370 transitions. [2018-11-23 07:51:06,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:51:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 370 transitions. [2018-11-23 07:51:06,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-23 07:51:06,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:51:06,464 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:51:06,465 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:51:06,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:51:06,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1754114806, now seen corresponding path program 1 times [2018-11-23 07:51:06,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:51:06,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:51:06,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:06,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:51:06,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:51:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-23 07:51:07,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:51:07,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:51:07,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:51:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:51:08,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:51:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-23 07:51:08,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:51:08,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 07:51:08,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 07:51:08,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 07:51:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:51:08,443 INFO L87 Difference]: Start difference. First operand 307 states and 370 transitions. Second operand 9 states. [2018-11-23 07:51:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:51:08,683 INFO L93 Difference]: Finished difference Result 625 states and 760 transitions. [2018-11-23 07:51:08,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:51:08,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 240 [2018-11-23 07:51:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:51:08,685 INFO L225 Difference]: With dead ends: 625 [2018-11-23 07:51:08,685 INFO L226 Difference]: Without dead ends: 328 [2018-11-23 07:51:08,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:51:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-23 07:51:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 314. [2018-11-23 07:51:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-23 07:51:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 377 transitions. [2018-11-23 07:51:08,714 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 377 transitions. Word has length 240 [2018-11-23 07:51:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:51:08,715 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 377 transitions. [2018-11-23 07:51:08,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 07:51:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 377 transitions. [2018-11-23 07:51:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-23 07:51:08,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:51:08,716 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:51:08,716 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:51:08,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:51:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1754131326, now seen corresponding path program 2 times [2018-11-23 07:51:08,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:51:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:51:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:08,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:51:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:51:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-23 07:51:09,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:51:09,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:51:09,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:51:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:51:09,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:51:09,506 INFO L87 Difference]: Start difference. First operand 314 states and 377 transitions. Second operand 6 states. [2018-11-23 07:51:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:51:09,585 INFO L93 Difference]: Finished difference Result 404 states and 482 transitions. [2018-11-23 07:51:09,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:51:09,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2018-11-23 07:51:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:51:09,588 INFO L225 Difference]: With dead ends: 404 [2018-11-23 07:51:09,588 INFO L226 Difference]: Without dead ends: 272 [2018-11-23 07:51:09,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:51:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-23 07:51:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2018-11-23 07:51:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-11-23 07:51:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 323 transitions. [2018-11-23 07:51:09,610 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 323 transitions. Word has length 245 [2018-11-23 07:51:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:51:09,611 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 323 transitions. [2018-11-23 07:51:09,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:51:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 323 transitions. [2018-11-23 07:51:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-23 07:51:09,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:51:09,612 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:51:09,612 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:51:09,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:51:09,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1466138120, now seen corresponding path program 1 times [2018-11-23 07:51:09,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:51:09,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:51:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:09,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:51:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:51:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:51:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-23 07:51:10,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:51:10,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:51:10,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:51:10,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:51:10,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:51:10,611 INFO L87 Difference]: Start difference. First operand 272 states and 323 transitions. Second operand 6 states. [2018-11-23 07:51:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:51:10,665 INFO L93 Difference]: Finished difference Result 272 states and 323 transitions. [2018-11-23 07:51:10,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:51:10,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2018-11-23 07:51:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:51:10,666 INFO L225 Difference]: With dead ends: 272 [2018-11-23 07:51:10,666 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 07:51:10,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:51:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 07:51:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 07:51:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 07:51:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 07:51:10,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 264 [2018-11-23 07:51:10,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:51:10,667 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:51:10,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:51:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:51:10,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 07:51:10,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 07:51:10,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:10,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:11,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:12,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:13,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:13,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:13,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:13,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 07:51:13,228 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 40 [2018-11-23 07:51:13,403 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 40 [2018-11-23 07:51:13,679 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 48 [2018-11-23 07:51:13,996 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 40 [2018-11-23 07:51:14,376 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 37 [2018-11-23 07:51:14,717 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2018-11-23 07:51:14,940 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:15,195 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:15,410 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:15,769 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 51 [2018-11-23 07:51:16,106 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 58 [2018-11-23 07:51:16,515 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 40 [2018-11-23 07:51:16,715 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 53 [2018-11-23 07:51:16,882 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2018-11-23 07:51:17,322 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 40 [2018-11-23 07:51:17,501 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 46 [2018-11-23 07:51:17,799 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 58 [2018-11-23 07:51:18,212 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:18,428 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2018-11-23 07:51:18,632 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2018-11-23 07:51:19,203 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 58 [2018-11-23 07:51:19,313 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 1 [2018-11-23 07:51:19,467 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2018-11-23 07:51:19,788 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 49 [2018-11-23 07:51:20,056 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 40 [2018-11-23 07:51:20,266 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:20,453 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2018-11-23 07:51:20,721 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2018-11-23 07:51:20,823 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2018-11-23 07:51:20,983 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-11-23 07:51:21,429 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 48 [2018-11-23 07:51:21,780 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 49 [2018-11-23 07:51:21,999 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2018-11-23 07:51:22,176 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 40 [2018-11-23 07:51:22,371 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-11-23 07:51:22,543 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 40 [2018-11-23 07:51:22,655 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2018-11-23 07:51:22,789 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2018-11-23 07:51:22,934 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-11-23 07:51:23,070 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-11-23 07:51:23,250 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 40 [2018-11-23 07:51:23,439 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 1 [2018-11-23 07:51:23,700 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2018-11-23 07:51:23,964 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2018-11-23 07:51:24,230 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2018-11-23 07:51:24,420 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 40 [2018-11-23 07:51:24,548 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-11-23 07:51:24,696 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2018-11-23 07:51:25,154 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2018-11-23 07:51:25,265 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2018-11-23 07:51:25,644 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 44 [2018-11-23 07:51:26,263 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 75 [2018-11-23 07:51:26,458 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2018-11-23 07:51:26,800 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 40 [2018-11-23 07:51:26,993 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 1 [2018-11-23 07:51:27,276 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:27,550 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:27,812 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:28,087 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-23 07:51:28,369 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 40 [2018-11-23 07:51:28,503 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2018-11-23 07:51:28,928 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-11-23 07:51:29,213 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2018-11-23 07:51:29,468 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2018-11-23 07:51:29,582 INFO L448 ceAbstractionStarter]: For program point DiskPerfLogErrorFINAL(lines 2978 3003) no Hoare annotation was computed. [2018-11-23 07:51:29,582 INFO L451 ceAbstractionStarter]: At program point L2996(line 2996) the Hoare annotation is: true [2018-11-23 07:51:29,582 INFO L448 ceAbstractionStarter]: For program point L2994(line 2994) no Hoare annotation was computed. [2018-11-23 07:51:29,582 INFO L451 ceAbstractionStarter]: At program point L2993-1(line 2993) the Hoare annotation is: true [2018-11-23 07:51:29,582 INFO L451 ceAbstractionStarter]: At program point L2993(line 2993) the Hoare annotation is: true [2018-11-23 07:51:29,582 INFO L451 ceAbstractionStarter]: At program point DiskPerfLogErrorENTRY(lines 2978 3003) the Hoare annotation is: true [2018-11-23 07:51:29,582 INFO L448 ceAbstractionStarter]: For program point L2988(lines 2988 3000) no Hoare annotation was computed. [2018-11-23 07:51:29,582 INFO L448 ceAbstractionStarter]: For program point L2988-1(lines 2988 3000) no Hoare annotation was computed. [2018-11-23 07:51:29,582 INFO L448 ceAbstractionStarter]: For program point L2985-1(line 2985) no Hoare annotation was computed. [2018-11-23 07:51:29,582 INFO L451 ceAbstractionStarter]: At program point L2985(line 2985) the Hoare annotation is: true [2018-11-23 07:51:29,582 INFO L448 ceAbstractionStarter]: For program point DiskPerfLogErrorEXIT(lines 2978 3003) no Hoare annotation was computed. [2018-11-23 07:51:29,582 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 2059 2080) no Hoare annotation was computed. [2018-11-23 07:51:29,582 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 2059 2080) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 2059 2080) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point IoWMIRegistrationControlEXIT(lines 1677 1695) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point IoWMIRegistrationControlFINAL(lines 1677 1695) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L451 ceAbstractionStarter]: At program point IoWMIRegistrationControlENTRY(lines 1677 1695) the Hoare annotation is: true [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1690(lines 1690 1694) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1688(lines 1688 1694) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1694) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1684(lines 1684 1694) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 1694) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1680(lines 1680 1694) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1694) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L451 ceAbstractionStarter]: At program point KeQueryPerformanceCounterENTRY(lines 1702 1716) the Hoare annotation is: true [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point KeQueryPerformanceCounterEXIT(lines 1702 1716) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1711-1(lines 1711 1714) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1710) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point L1706-2(lines 1702 1716) no Hoare annotation was computed. [2018-11-23 07:51:29,583 INFO L448 ceAbstractionStarter]: For program point KeQueryPerformanceCounterFINAL(lines 1702 1716) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L451 ceAbstractionStarter]: At program point KeQuerySystemTimeENTRY(lines 1573 1576) the Hoare annotation is: true [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point KeQuerySystemTimeFINAL(lines 1573 1576) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point KeQuerySystemTimeEXIT(lines 1573 1576) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L444 ceAbstractionStarter]: At program point L3330-2(lines 3330 3335) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point L3520(line 3520) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point L3330-3(lines 3330 3335) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point L3578(lines 3578 3584) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3233 3624) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L444 ceAbstractionStarter]: At program point L3256-2(lines 3256 3261) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point L3256-3(lines 3256 3261) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point L3496(lines 3496 3541) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point $Ultimate##35(lines 3507 3537) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point $Ultimate##34(lines 3507 3537) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point L3530(line 3530) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L448 ceAbstractionStarter]: For program point L3563(lines 3563 3567) no Hoare annotation was computed. [2018-11-23 07:51:29,584 INFO L444 ceAbstractionStarter]: At program point L3464(line 3464) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,584 INFO L444 ceAbstractionStarter]: At program point L3497(lines 3496 3541) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~myStatus~0 259)) (= 0 ~compRegistered~0) (not (= ~DC~0 ~SKIP2~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~IPC~0 ~DC~0)) (= ~routine~0 0) (not (= ~IPC~0 ~SKIP2~0)) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~NP~0)) (not (= ~pended~0 1)) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3464-1(lines 3461 3623) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3555(lines 3555 3559) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L444 ceAbstractionStarter]: At program point L3580(line 3580) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,585 INFO L451 ceAbstractionStarter]: At program point L3506(lines 3505 3538) the Hoare annotation is: true [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 3233 3624) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3333(lines 3333 3334) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L444 ceAbstractionStarter]: At program point L3589(lines 3576 3617) the Hoare annotation is: (let ((.cse7 (= ~IPC~0 ~s~0)) (.cse0 (not (= ~IPC~0 ~SKIP2~0))) (.cse4 (not (= ~pended~0 1)))) (let ((.cse5 (= ~lowerDriverReturn~0 main_~status~11)) (.cse6 (and (not (= ~IPC~0 ~DC~0)) .cse0 (not (= ~DC~0 ~SKIP2~0)) .cse4)) (.cse1 (not (= ~s~0 ~SKIP2~0))) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (not .cse7))) (or (and (not (= 259 main_~status~11)) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not (= ~MPR1~0 ~SKIP1~0)) .cse6 (= ~SKIP2~0 ~s~0) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse5 .cse6 .cse7) (and (= 0 main_~status~11) .cse1 .cse2 .cse3 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3490(lines 3490 3543) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 3233 3624) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3259(lines 3259 3260) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3515(line 3515) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3573(lines 3573 3618) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3466(lines 3461 3623) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3499(lines 3499 3540) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L444 ceAbstractionStarter]: At program point L3491(lines 3490 3543) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (not (= ~IPC~0 ~DC~0)) (= 0 ~compRegistered~0) (not (= ~DC~0 ~SKIP2~0)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3483(lines 3466 3551) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3599(lines 3599 3615) no Hoare annotation was computed. [2018-11-23 07:51:29,585 INFO L444 ceAbstractionStarter]: At program point L3500(lines 3499 3540) the Hoare annotation is: (or (and (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~compRegistered~0) (not (= ~DC~0 ~IPC~0)) (not (= ~IPC~0 ~SKIP2~0)) (not (= ~DC~0 ~SKIP2~0)) (= ~NP~0 ~s~0) (not (= ~pended~0 1)) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,585 INFO L448 ceAbstractionStarter]: For program point L3591(lines 3591 3597) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3525(line 3525) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3608(lines 3608 3614) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3608-1(lines 3554 3621) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3476(lines 3476 3481) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L444 ceAbstractionStarter]: At program point L3476-2(lines 3476 3481) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~myStatus~0 259)) (= 0 ~compRegistered~0) (not (= ~DC~0 ~SKIP2~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~IPC~0 ~DC~0)) (= ~routine~0 0) (not (= ~IPC~0 ~SKIP2~0)) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~NP~0)) (not (= ~pended~0 1)) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3600(lines 3600 3606) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3493(lines 3493 3542) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3576(lines 3576 3617) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3510(line 3510) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3502(lines 3502 3539) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L444 ceAbstractionStarter]: At program point L3593(line 3593) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,586 INFO L444 ceAbstractionStarter]: At program point L3494(lines 3493 3542) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (not (= ~DC~0 ~IPC~0)) (not (= ~IPC~0 ~SKIP2~0)) (not (= ~DC~0 ~SKIP2~0)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,586 INFO L444 ceAbstractionStarter]: At program point L3610(line 3610) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,586 INFO L448 ceAbstractionStarter]: For program point L3577(lines 3577 3587) no Hoare annotation was computed. [2018-11-23 07:51:29,586 INFO L444 ceAbstractionStarter]: At program point L3602(line 3602) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,586 INFO L444 ceAbstractionStarter]: At program point L3536(lines 3466 3551) the Hoare annotation is: (let ((.cse7 (= ~IPC~0 ~s~0))) (let ((.cse1 (not (= ~s~0 ~SKIP2~0))) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (not .cse7)) (.cse5 (= ~lowerDriverReturn~0 main_~status~11)) (.cse0 (not (= ~IPC~0 ~SKIP2~0))) (.cse6 (not (= ~DC~0 ~s~0))) (.cse4 (not (= ~pended~0 1)))) (or (and (not (= 259 main_~status~11)) .cse0 .cse1 .cse2 .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) (and .cse5 (not (= ~DC~0 ~SKIP2~0)) .cse1 .cse6 .cse4 .cse7) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~11) .cse1 .cse2 .cse3 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse5 (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~DC~0 ~IPC~0)) .cse0 (= ~SKIP2~0 ~s~0) .cse6 .cse4 (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-11-23 07:51:29,586 INFO L444 ceAbstractionStarter]: At program point L3569(lines 3562 3620) the Hoare annotation is: (let ((.cse7 (= ~IPC~0 ~s~0))) (let ((.cse1 (not (= ~s~0 ~SKIP2~0))) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (not .cse7)) (.cse5 (= ~lowerDriverReturn~0 main_~status~11)) (.cse0 (not (= ~IPC~0 ~SKIP2~0))) (.cse6 (not (= ~DC~0 ~s~0))) (.cse4 (not (= ~pended~0 1)))) (or (and (not (= 259 main_~status~11)) .cse0 .cse1 .cse2 .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (and .cse5 (not (= ~DC~0 ~SKIP2~0)) .cse1 .cse6 .cse4 .cse7) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~11) .cse1 .cse2 .cse3 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse5 (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~DC~0 ~IPC~0)) .cse0 (= ~SKIP2~0 ~s~0) .cse6 .cse4 (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-11-23 07:51:29,587 INFO L444 ceAbstractionStarter]: At program point L3503(lines 3502 3539) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (not (= ~DC~0 ~IPC~0)) (not (= ~IPC~0 ~SKIP2~0)) (not (= ~DC~0 ~SKIP2~0)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2018-11-23 07:51:29,587 INFO L444 ceAbstractionStarter]: At program point L3561(lines 3554 3621) the Hoare annotation is: (let ((.cse7 (= ~IPC~0 ~s~0))) (let ((.cse1 (not (= ~s~0 ~SKIP2~0))) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (not .cse7)) (.cse5 (= ~lowerDriverReturn~0 main_~status~11)) (.cse0 (not (= ~IPC~0 ~SKIP2~0))) (.cse6 (not (= ~DC~0 ~s~0))) (.cse4 (not (= ~pended~0 1)))) (or (and (not (= 259 main_~status~11)) .cse0 .cse1 .cse2 .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) (and .cse5 (not (= ~DC~0 ~SKIP2~0)) .cse1 .cse6 .cse4 .cse7) (= ~s~0 ~UNLOADED~0) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~11) .cse1 .cse2 .cse3 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse5 (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~DC~0 ~IPC~0)) .cse0 (= ~SKIP2~0 ~s~0) .cse6 .cse4 (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2018-11-23 07:51:29,587 INFO L451 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 2156 2166) the Hoare annotation is: true [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 2156 2166) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 2156 2166) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L444 ceAbstractionStarter]: At program point L4072(line 4072) the Hoare annotation is: (or (or (not (= ~setEventCalled~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 ~pended~0) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) [2018-11-23 07:51:29,587 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 4064 4077) the Hoare annotation is: (or (= ~NP~0 ~s~0) (or (or (not (= ~setEventCalled~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 ~pended~0) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point L4072-1(lines 4064 4077) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 4064 4077) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L444 ceAbstractionStarter]: At program point L4445(line 4445) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point L4445-1(line 4445) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point L4499(lines 4499 4506) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L444 ceAbstractionStarter]: At program point L4466(lines 4465 4484) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point L4437(lines 4437 4451) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 4427 4511) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point L4491(lines 4491 4497) no Hoare annotation was computed. [2018-11-23 07:51:29,587 INFO L444 ceAbstractionStarter]: At program point L4454(line 4454) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,587 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 4427 4511) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L4504-1(lines 4486 4508) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 4427 4511) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,588 INFO L444 ceAbstractionStarter]: At program point L4504(line 4504) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,588 INFO L444 ceAbstractionStarter]: At program point L4463(lines 4462 4485) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L4443(lines 4443 4450) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L444 ceAbstractionStarter]: At program point L4439(line 4439) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L4439-1(line 4439) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L4443-2(lines 4436 4459) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 4470 4482) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 4470 4482) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L444 ceAbstractionStarter]: At program point L4481(lines 4435 4510) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L4436-1(lines 4435 4510) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L444 ceAbstractionStarter]: At program point L4469(lines 4468 4483) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L4436(lines 4436 4461) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L4465(lines 4465 4484) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L4490(lines 4490 4507) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L444 ceAbstractionStarter]: At program point L2368(line 2368) the Hoare annotation is: (or (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 2349 2372) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L2368-1(line 2368) no Hoare annotation was computed. [2018-11-23 07:51:29,588 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPowerENTRY(lines 2349 2372) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,588 INFO L448 ceAbstractionStarter]: For program point L2361-1(lines 2357 2363) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L444 ceAbstractionStarter]: At program point L2361(line 2361) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 2349 2372) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point L2357(lines 2357 2363) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L451 ceAbstractionStarter]: At program point InterlockedIncrementENTRY(lines 1527 1529) the Hoare annotation is: true [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point InterlockedIncrementFINAL(lines 1527 1529) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point InterlockedIncrementEXIT(lines 1527 1529) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L444 ceAbstractionStarter]: At program point L4282(lines 4274 4295) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse6 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (= 1 ~pended~0)) (.cse5 (= ~NP~0 ~MPR1~0)) (.cse9 (= ~SKIP2~0 ~DC~0)) (.cse7 (= ~DC~0 ~IPC~0)) (.cse11 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= 0 ~routine~0))) (.cse2 (= ~myStatus~0 259)) (.cse3 (not (= ~compRegistered~0 1))) (.cse10 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= ~NP~0 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~MPR3~0)) (or .cse6 (or (or (or .cse7 .cse8 .cse9) .cse10) .cse11))) (or (and (= ~NP~0 ~s~0) (= 1 ~setEventCalled~0)) (or .cse0 .cse6 .cse8 .cse5 .cse9 .cse7 .cse11 .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse10 .cse4)))) [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 4269 4312) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point L4307(lines 4269 4312) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point L4274(lines 4274 4295) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 4301 4308) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 4301 4308) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L444 ceAbstractionStarter]: At program point L4297(lines 4296 4310) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0)) (.cse1 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse9 (= 1 ~pended~0)) (.cse6 (= ~NP~0 ~MPR1~0)) (.cse10 (= ~SKIP2~0 ~DC~0)) (.cse8 (= ~DC~0 ~IPC~0)) (.cse12 (= ~SKIP1~0 ~NP~0)) (.cse2 (not (= 0 ~routine~0))) (.cse3 (= ~myStatus~0 259)) (.cse4 (not (= ~compRegistered~0 1))) (.cse11 (= ~SKIP2~0 ~IPC~0)) (.cse5 (= ~NP~0 ~MPR3~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| ~MPR3~0)) (or .cse7 (or (or (or .cse8 .cse9 .cse10) .cse11) .cse12)))) (or (and .cse0 (= 1 ~setEventCalled~0)) (or .cse1 .cse7 .cse9 .cse6 .cse10 .cse8 .cse12 .cse2 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse11 .cse5)))) [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point L4287(lines 4287 4293) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point L4287-1(lines 4273 4311) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L444 ceAbstractionStarter]: At program point L4289(line 4289) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse6 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (= 1 ~pended~0)) (.cse5 (= ~NP~0 ~MPR1~0)) (.cse9 (= ~SKIP2~0 ~DC~0)) (.cse7 (= ~DC~0 ~IPC~0)) (.cse11 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= 0 ~routine~0))) (.cse2 (= ~myStatus~0 259)) (.cse3 (not (= ~compRegistered~0 1))) (.cse10 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= ~NP~0 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~MPR3~0)) (or .cse6 (or (or (or .cse7 .cse8 .cse9) .cse10) .cse11))) (or .cse0 .cse6 .cse8 .cse5 .cse9 .cse7 .cse11 .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse10 .cse4))) [2018-11-23 07:51:29,589 INFO L448 ceAbstractionStarter]: For program point L4275(lines 4275 4280) no Hoare annotation was computed. [2018-11-23 07:51:29,589 INFO L444 ceAbstractionStarter]: At program point L4300(lines 4299 4309) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0)) (.cse1 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse9 (= 1 ~pended~0)) (.cse6 (= ~NP~0 ~MPR1~0)) (.cse10 (= ~SKIP2~0 ~DC~0)) (.cse8 (= ~DC~0 ~IPC~0)) (.cse12 (= ~SKIP1~0 ~NP~0)) (.cse2 (not (= 0 ~routine~0))) (.cse3 (= ~myStatus~0 259)) (.cse4 (not (= ~compRegistered~0 1))) (.cse11 (= ~SKIP2~0 ~IPC~0)) (.cse5 (= ~NP~0 ~MPR3~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| ~MPR3~0)) (or .cse7 (or (or (or .cse8 .cse9 .cse10) .cse11) .cse12)))) (or (and .cse0 (= 1 ~setEventCalled~0)) (or .cse1 .cse7 .cse9 .cse6 .cse10 .cse8 .cse12 .cse2 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse11 .cse5)))) [2018-11-23 07:51:29,590 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 4269 4312) the Hoare annotation is: (let ((.cse1 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (not (= 0 ~routine~0))) (.cse9 (= ~myStatus~0 259)) (.cse10 (not (= ~compRegistered~0 1))) (.cse12 (= ~NP~0 ~MPR3~0)) (.cse4 (= ~NP~0 ~MPR1~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (= ~DC~0 ~IPC~0)) (.cse3 (= 1 ~pended~0)) (.cse5 (= ~SKIP2~0 ~DC~0)) (.cse11 (= ~SKIP2~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~NP~0)) (.cse0 (= 1 ~setEventCalled~0))) (and (or (and (= ~NP~0 ~s~0) .cse0) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11 .cse12)) (or (or .cse1 .cse8 .cse9 .cse10 .cse12 .cse4 (not (= |old(~s~0)| ~MPR3~0)) (or .cse2 (or (or (or .cse6 .cse3 .cse5) .cse11) .cse7))) (and (= ~MPR3~0 ~s~0) .cse0)))) [2018-11-23 07:51:29,590 INFO L444 ceAbstractionStarter]: At program point L4172(line 4172) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~IPC~0)) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 (not (= ~compRegistered~0 0)) .cse3) (or (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) (or (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (or (= ~SKIP1~0 ~NP~0) (or .cse0 .cse1 (= ~SKIP2~0 ~IPC~0) .cse2)) .cse3)))) [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point L4172-1(lines 4164 4177) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 4164 4177) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (= 1 ~pended~0)) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) .cse4) (or (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse0 (or (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (or (= ~SKIP1~0 ~NP~0) (or .cse1 .cse2 (= ~SKIP2~0 ~IPC~0) .cse3)) .cse4)))) [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point L4168(lines 4168 4174) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 4164 4177) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 07:51:29,590 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point IoAllocateErrorLogEntryFINAL(lines 1613 1618) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1616) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point IoAllocateErrorLogEntryEXIT(lines 1613 1618) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L451 ceAbstractionStarter]: At program point IoAllocateErrorLogEntryENTRY(lines 1613 1618) the Hoare annotation is: true [2018-11-23 07:51:29,590 INFO L451 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 1533 1537) the Hoare annotation is: true [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 1533 1537) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 1533 1537) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L451 ceAbstractionStarter]: At program point L3808(lines 3807 3820) the Hoare annotation is: true [2018-11-23 07:51:29,590 INFO L448 ceAbstractionStarter]: For program point L3804(lines 3804 3821) no Hoare annotation was computed. [2018-11-23 07:51:29,590 INFO L451 ceAbstractionStarter]: At program point L3805(lines 3804 3821) the Hoare annotation is: true [2018-11-23 07:51:29,590 INFO L451 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 3795 3823) the Hoare annotation is: true [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point L3818(lines 3795 3823) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 3795 3823) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 3809 3819) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 3809 3819) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 4257 4264) the Hoare annotation is: true [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 4257 4264) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 4257 4264) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 3219 3232) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 3219 3232) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 3219 3232) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point L2337-1(lines 2333 2339) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L444 ceAbstractionStarter]: At program point DiskPerfSendToNextDriverENTRY(lines 2328 2348) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,591 INFO L444 ceAbstractionStarter]: At program point L2337(line 2337) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point L2333(lines 2333 2339) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 2328 2348) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L444 ceAbstractionStarter]: At program point L2344(line 2344) the Hoare annotation is: (or (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 2328 2348) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point L2344-1(line 2344) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 07:51:29,591 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,591 INFO L448 ceAbstractionStarter]: For program point L2301-1(line 2301) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point L2301(line 2301) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= ~compRegistered~0 1) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= 259 DiskPerfStartDevice_~status~2)) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 2289 2305) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point L2298(line 2298) the Hoare annotation is: (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= ~routine~0 0)) (.cse3 (= ~NP~0 ~s~0)) (.cse4 (not (= ~pended~0 1)))) (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= |old(~myStatus~0)| DiskPerfStartDevice_~status~2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (not (= 259 DiskPerfStartDevice_~status~2)) (= 1 ~setEventCalled~0) .cse4))) [2018-11-23 07:51:29,592 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 2289 2305) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point L2296(line 2296) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,592 INFO L448 ceAbstractionStarter]: For program point L2297-1(line 2297) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point L2297(line 2297) the Hoare annotation is: (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= ~routine~0 0)) (.cse3 (= ~NP~0 ~s~0)) (.cse4 (not (= ~pended~0 1)))) (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= |old(~myStatus~0)| DiskPerfStartDevice_~status~2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (not (= 259 DiskPerfStartDevice_~status~2)) (= 1 ~setEventCalled~0) .cse4))) [2018-11-23 07:51:29,592 INFO L448 ceAbstractionStarter]: For program point L2298-1(line 2298) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 2289 2305) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L448 ceAbstractionStarter]: For program point L2296-1(line 2296) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L448 ceAbstractionStarter]: For program point L2785-1(line 2785) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point L2785(line 2785) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (= 1 ~setEventCalled~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,592 INFO L448 ceAbstractionStarter]: For program point L2942(lines 2942 2962) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point L2876(line 2876) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,592 INFO L448 ceAbstractionStarter]: For program point L2909-1(line 2909) no Hoare annotation was computed. [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point L2909(line 2909) the Hoare annotation is: (or (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,592 INFO L444 ceAbstractionStarter]: At program point L2942-1(lines 2802 2964) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2876-1(line 2876) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2835-1(line 2835) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L444 ceAbstractionStarter]: At program point L2835(line 2835) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2794(lines 2794 2801) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2794-2(lines 2774 2976) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2852(lines 2812 2964) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2885(lines 2885 2892) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L444 ceAbstractionStarter]: At program point L2910(line 2910) the Hoare annotation is: (or (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,593 INFO L444 ceAbstractionStarter]: At program point L2943(lines 2939 2963) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2844(lines 2844 2851) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2910-1(line 2910) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2844-2(lines 2812 2964) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2968(lines 2968 2974) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2968-1(lines 2968 2974) no Hoare annotation was computed. [2018-11-23 07:51:29,593 INFO L448 ceAbstractionStarter]: For program point L2869-1(lines 2869 2871) no Hoare annotation was computed. [2018-11-23 07:51:29,594 INFO L444 ceAbstractionStarter]: At program point L2869(lines 2869 2871) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,594 INFO L444 ceAbstractionStarter]: At program point L2828(lines 2828 2830) the Hoare annotation is: (or (and (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= 0 DiskPerfRegisterDevice_~output~0.base))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,594 INFO L448 ceAbstractionStarter]: For program point L2861-1(line 2861) no Hoare annotation was computed. [2018-11-23 07:51:29,594 INFO L444 ceAbstractionStarter]: At program point L2861(line 2861) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,594 INFO L448 ceAbstractionStarter]: For program point L2828-1(lines 2828 2830) no Hoare annotation was computed. [2018-11-23 07:51:29,594 INFO L444 ceAbstractionStarter]: At program point L2820(line 2820) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,594 INFO L448 ceAbstractionStarter]: For program point L2820-1(line 2820) no Hoare annotation was computed. [2018-11-23 07:51:29,594 INFO L448 ceAbstractionStarter]: For program point L2779-1(lines 2779 2781) no Hoare annotation was computed. [2018-11-23 07:51:29,594 INFO L444 ceAbstractionStarter]: At program point L2779(lines 2779 2781) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,594 INFO L444 ceAbstractionStarter]: At program point L2796(line 2796) the Hoare annotation is: (let ((.cse2 (not (= ~pended~0 1))) (.cse1 (= 1 ~setEventCalled~0)) (.cse0 (<= 259 DiskPerfRegisterDevice_~status~7)) (.cse3 (<= DiskPerfRegisterDevice_~status~7 259))) (or (and (= ~NP~0 ~s~0) .cse0 .cse1 .cse2 .cse3) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (and .cse2 (= ~MPR3~0 ~s~0) .cse1) .cse0 .cse3))) [2018-11-23 07:51:29,594 INFO L448 ceAbstractionStarter]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2018-11-23 07:51:29,594 INFO L448 ceAbstractionStarter]: For program point L2920(lines 2920 2927) no Hoare annotation was computed. [2018-11-23 07:51:29,594 INFO L448 ceAbstractionStarter]: For program point L2887-1(line 2887) no Hoare annotation was computed. [2018-11-23 07:51:29,595 INFO L444 ceAbstractionStarter]: At program point L2887(line 2887) the Hoare annotation is: (let ((.cse2 (not (= ~pended~0 1))) (.cse1 (= 1 ~setEventCalled~0)) (.cse0 (<= 259 DiskPerfRegisterDevice_~status~7)) (.cse3 (<= DiskPerfRegisterDevice_~status~7 259))) (or (and (= ~NP~0 ~s~0) .cse0 .cse1 .cse2 .cse3) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (and .cse2 (= ~MPR3~0 ~s~0) .cse1) .cse0 .cse3))) [2018-11-23 07:51:29,595 INFO L444 ceAbstractionStarter]: At program point L2945(line 2945) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,595 INFO L444 ceAbstractionStarter]: At program point L2846(line 2846) the Hoare annotation is: (let ((.cse2 (not (= 0 DiskPerfRegisterDevice_~output~0.base))) (.cse1 (= 1 ~setEventCalled~0)) (.cse0 (not (= ~pended~0 1)))) (or (and (and (and .cse0 (= ~MPR3~0 ~s~0) .cse1) .cse2) (= 259 DiskPerfRegisterDevice_~status~7)) (and .cse2 (= ~NP~0 ~s~0) (<= 259 DiskPerfRegisterDevice_~status~7) .cse1 .cse0 (<= DiskPerfRegisterDevice_~status~7 259)) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)))) [2018-11-23 07:51:29,595 INFO L448 ceAbstractionStarter]: For program point L2846-1(line 2846) no Hoare annotation was computed. [2018-11-23 07:51:29,595 INFO L444 ceAbstractionStarter]: At program point L2970(line 2970) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,595 INFO L448 ceAbstractionStarter]: For program point L2929-1(line 2929) no Hoare annotation was computed. [2018-11-23 07:51:29,595 INFO L444 ceAbstractionStarter]: At program point L2929(line 2929) the Hoare annotation is: (or (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,595 INFO L448 ceAbstractionStarter]: For program point L2946(lines 2946 2947) no Hoare annotation was computed. [2018-11-23 07:51:29,595 INFO L444 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 2760 2977) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,596 INFO L444 ceAbstractionStarter]: At program point L2922(line 2922) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,596 INFO L444 ceAbstractionStarter]: At program point L2856(line 2856) the Hoare annotation is: (or (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (not (= 0 DiskPerfRegisterDevice_~output~0.base)) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,596 INFO L448 ceAbstractionStarter]: For program point L2922-1(line 2922) no Hoare annotation was computed. [2018-11-23 07:51:29,596 INFO L448 ceAbstractionStarter]: For program point L2856-1(line 2856) no Hoare annotation was computed. [2018-11-23 07:51:29,596 INFO L444 ceAbstractionStarter]: At program point L2914(line 2914) the Hoare annotation is: (or (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,596 INFO L448 ceAbstractionStarter]: For program point L2914-1(line 2914) no Hoare annotation was computed. [2018-11-23 07:51:29,596 INFO L448 ceAbstractionStarter]: For program point L2815-1(line 2815) no Hoare annotation was computed. [2018-11-23 07:51:29,596 INFO L444 ceAbstractionStarter]: At program point L2815(line 2815) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,596 INFO L448 ceAbstractionStarter]: For program point L2873(lines 2873 2881) no Hoare annotation was computed. [2018-11-23 07:51:29,596 INFO L448 ceAbstractionStarter]: For program point L2931(lines 2931 2938) no Hoare annotation was computed. [2018-11-23 07:51:29,596 INFO L448 ceAbstractionStarter]: For program point L2832(lines 2832 2840) no Hoare annotation was computed. [2018-11-23 07:51:29,597 INFO L448 ceAbstractionStarter]: For program point L2931-2(lines 2812 2964) no Hoare annotation was computed. [2018-11-23 07:51:29,597 INFO L444 ceAbstractionStarter]: At program point L2956(lines 2956 2957) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,597 INFO L444 ceAbstractionStarter]: At program point L2956-1(lines 2956 2957) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,597 INFO L448 ceAbstractionStarter]: For program point L2783(lines 2783 2790) no Hoare annotation was computed. [2018-11-23 07:51:29,597 INFO L444 ceAbstractionStarter]: At program point L2808(line 2808) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,597 INFO L444 ceAbstractionStarter]: At program point L2808-1(line 2808) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,605 INFO L448 ceAbstractionStarter]: For program point L2899-1(line 2899) no Hoare annotation was computed. [2018-11-23 07:51:29,605 INFO L444 ceAbstractionStarter]: At program point L2899(line 2899) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,605 INFO L444 ceAbstractionStarter]: At program point L2792(line 2792) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,605 INFO L448 ceAbstractionStarter]: For program point L2792-1(line 2792) no Hoare annotation was computed. [2018-11-23 07:51:29,605 INFO L444 ceAbstractionStarter]: At program point L2916(lines 2916 2918) the Hoare annotation is: (or (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,605 INFO L448 ceAbstractionStarter]: For program point L2949(lines 2949 2953) no Hoare annotation was computed. [2018-11-23 07:51:29,605 INFO L448 ceAbstractionStarter]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2018-11-23 07:51:29,605 INFO L444 ceAbstractionStarter]: At program point L2883(line 2883) the Hoare annotation is: (or (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,606 INFO L448 ceAbstractionStarter]: For program point L2916-1(lines 2916 2918) no Hoare annotation was computed. [2018-11-23 07:51:29,606 INFO L444 ceAbstractionStarter]: At program point L2842(line 2842) the Hoare annotation is: (or (and (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= 0 DiskPerfRegisterDevice_~output~0.base))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) [2018-11-23 07:51:29,606 INFO L448 ceAbstractionStarter]: For program point L2809(lines 2809 2810) no Hoare annotation was computed. [2018-11-23 07:51:29,606 INFO L448 ceAbstractionStarter]: For program point L2842-1(line 2842) no Hoare annotation was computed. [2018-11-23 07:51:29,606 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 2760 2977) no Hoare annotation was computed. [2018-11-23 07:51:29,606 INFO L448 ceAbstractionStarter]: For program point L2966(line 2966) no Hoare annotation was computed. [2018-11-23 07:51:29,606 INFO L448 ceAbstractionStarter]: For program point L2933-1(line 2933) no Hoare annotation was computed. [2018-11-23 07:51:29,606 INFO L444 ceAbstractionStarter]: At program point L2933(line 2933) the Hoare annotation is: (let ((.cse1 (not (= ~pended~0 1))) (.cse0 (= 1 ~setEventCalled~0))) (or (and (= ~NP~0 ~s~0) .cse0 .cse1) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and .cse1 (= ~MPR3~0 ~s~0) .cse0))) [2018-11-23 07:51:29,611 INFO L448 ceAbstractionStarter]: For program point L2958(lines 2958 2959) no Hoare annotation was computed. [2018-11-23 07:51:29,611 INFO L448 ceAbstractionStarter]: For program point L2859(lines 2859 2866) no Hoare annotation was computed. [2018-11-23 07:51:29,611 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 2760 2977) no Hoare annotation was computed. [2018-11-23 07:51:29,611 INFO L448 ceAbstractionStarter]: For program point L2818(lines 2818 2825) no Hoare annotation was computed. [2018-11-23 07:51:29,611 INFO L444 ceAbstractionStarter]: At program point L2393(line 2393) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,611 INFO L448 ceAbstractionStarter]: For program point L2391(lines 2391 2405) no Hoare annotation was computed. [2018-11-23 07:51:29,611 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 2373 2426) no Hoare annotation was computed. [2018-11-23 07:51:29,611 INFO L444 ceAbstractionStarter]: At program point L2387-1(line 2387) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,612 INFO L444 ceAbstractionStarter]: At program point L2418(line 2418) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (and (= ~compRegistered~0 1) (<= DiskPerfForwardIrpSynchronous_~status~4 259) (not (= ~pended~0 1)) (= ~routine~0 0) (= ~MPR3~0 ~s~0) (= 1 ~setEventCalled~0) (<= 259 DiskPerfForwardIrpSynchronous_~status~4)) (not (= |old(~compRegistered~0)| 0))) [2018-11-23 07:51:29,612 INFO L444 ceAbstractionStarter]: At program point L2387(line 2387) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,612 INFO L448 ceAbstractionStarter]: For program point L2416(lines 2416 2423) no Hoare annotation was computed. [2018-11-23 07:51:29,612 INFO L448 ceAbstractionStarter]: For program point L2418-1(line 2418) no Hoare annotation was computed. [2018-11-23 07:51:29,612 INFO L444 ceAbstractionStarter]: At program point L2414(line 2414) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (and (= ~compRegistered~0 1) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2416-2(lines 2416 2423) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2414-1(line 2414) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L444 ceAbstractionStarter]: At program point L2398(line 2398) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2396(lines 2396 2404) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2396-1(lines 2391 2405) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2388(line 2388) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L444 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 2373 2426) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 2373 2426) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2653(lines 2653 2657) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2612(lines 2612 2669) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2612-2(lines 2612 2669) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2637-1(lines 2637 2641) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2629-1(line 2629) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L444 ceAbstractionStarter]: At program point L2629(line 2629) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2621-1(line 2621) no Hoare annotation was computed. [2018-11-23 07:51:29,618 INFO L444 ceAbstractionStarter]: At program point L2621(line 2621) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,618 INFO L448 ceAbstractionStarter]: For program point L2617(lines 2617 2626) no Hoare annotation was computed. [2018-11-23 07:51:29,619 INFO L444 ceAbstractionStarter]: At program point L2630(line 2630) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,622 INFO L444 ceAbstractionStarter]: At program point L2663-1(line 2663) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,622 INFO L444 ceAbstractionStarter]: At program point L2663(line 2663) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,622 INFO L448 ceAbstractionStarter]: For program point L2630-1(line 2630) no Hoare annotation was computed. [2018-11-23 07:51:29,622 INFO L448 ceAbstractionStarter]: For program point L2651-1(lines 2651 2660) no Hoare annotation was computed. [2018-11-23 07:51:29,622 INFO L448 ceAbstractionStarter]: For program point L2651(lines 2651 2660) no Hoare annotation was computed. [2018-11-23 07:51:29,622 INFO L444 ceAbstractionStarter]: At program point L2680(line 2680) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,622 INFO L448 ceAbstractionStarter]: For program point L2680-1(line 2680) no Hoare annotation was computed. [2018-11-23 07:51:29,622 INFO L448 ceAbstractionStarter]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2018-11-23 07:51:29,623 INFO L444 ceAbstractionStarter]: At program point L2643(line 2643) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,623 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 2596 2685) no Hoare annotation was computed. [2018-11-23 07:51:29,623 INFO L448 ceAbstractionStarter]: For program point L2664(lines 2664 2665) no Hoare annotation was computed. [2018-11-23 07:51:29,623 INFO L444 ceAbstractionStarter]: At program point L2635-2(lines 2635 2647) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,623 INFO L448 ceAbstractionStarter]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2018-11-23 07:51:29,623 INFO L444 ceAbstractionStarter]: At program point L2631(line 2631) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,623 INFO L444 ceAbstractionStarter]: At program point DiskPerfDeviceControlENTRY(lines 2596 2685) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,623 INFO L444 ceAbstractionStarter]: At program point L2648(lines 2634 2649) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,623 INFO L448 ceAbstractionStarter]: For program point L2611(lines 2611 2683) no Hoare annotation was computed. [2018-11-23 07:51:29,623 INFO L448 ceAbstractionStarter]: For program point L2673-1(line 2673) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L444 ceAbstractionStarter]: At program point L2673(line 2673) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= DiskPerfDeviceControl_~status~5 259)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point L2636(line 2636) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 2596 2685) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point L2434-1(line 2434) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L444 ceAbstractionStarter]: At program point DiskPerfCreateENTRY(lines 2427 2438) the Hoare annotation is: (or (= ~NP~0 ~s~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 2427 2438) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 2427 2438) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L444 ceAbstractionStarter]: At program point L2434(line 2434) the Hoare annotation is: (or (= ~NP~0 ~s~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2039) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 2035 2041) the Hoare annotation is: true [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 2035 2041) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 2035 2041) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 2306 2327) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 2306 2327) no Hoare annotation was computed. [2018-11-23 07:51:29,625 INFO L448 ceAbstractionStarter]: For program point L2323-1(line 2323) no Hoare annotation was computed. [2018-11-23 07:51:29,626 INFO L444 ceAbstractionStarter]: At program point L2323(line 2323) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (= ~routine~0 0)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (not (= ~pended~0 1)))) (or (= ~SKIP1~0 ~MPR1~0) (and (not (= 259 DiskPerfRemoveDevice_~status~3)) .cse0 .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~3) .cse0 .cse1 .cse2 .cse3) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)))) [2018-11-23 07:51:29,626 INFO L444 ceAbstractionStarter]: At program point L2318(line 2318) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2018-11-23 07:51:29,626 INFO L444 ceAbstractionStarter]: At program point L2316(line 2316) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2018-11-23 07:51:29,631 INFO L448 ceAbstractionStarter]: For program point L2317-1(line 2317) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L444 ceAbstractionStarter]: At program point L2317(line 2317) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point L2318-1(line 2318) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L444 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 2306 2327) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2018-11-23 07:51:29,632 INFO L444 ceAbstractionStarter]: At program point L2314(line 2314) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point L2316-1(line 2316) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point L2314-1(line 2314) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point L3184(lines 3184 3192) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point L3184-2(lines 3184 3192) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L451 ceAbstractionStarter]: At program point DiskPerfAddCountersENTRY(lines 3174 3195) the Hoare annotation is: true [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point DiskPerfAddCountersFINAL(lines 3174 3195) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point DiskPerfAddCountersEXIT(lines 3174 3195) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2018-11-23 07:51:29,632 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,632 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 2278 2288) no Hoare annotation was computed. [2018-11-23 07:51:29,638 INFO L451 ceAbstractionStarter]: At program point L2284(line 2284) the Hoare annotation is: true [2018-11-23 07:51:29,638 INFO L451 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 2278 2288) the Hoare annotation is: true [2018-11-23 07:51:29,638 INFO L448 ceAbstractionStarter]: For program point L2284-1(line 2284) no Hoare annotation was computed. [2018-11-23 07:51:29,638 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 2278 2288) no Hoare annotation was computed. [2018-11-23 07:51:29,638 INFO L448 ceAbstractionStarter]: For program point L4098-1(line 4098) no Hoare annotation was computed. [2018-11-23 07:51:29,638 INFO L448 ceAbstractionStarter]: For program point L4090(lines 4090 4111) no Hoare annotation was computed. [2018-11-23 07:51:29,639 INFO L448 ceAbstractionStarter]: For program point L4090-1(lines 4089 4160) no Hoare annotation was computed. [2018-11-23 07:51:29,639 INFO L444 ceAbstractionStarter]: At program point L4119(lines 4118 4133) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= ~DC~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (not (= ~pended~0 1))) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (= ~SKIP2~0 ~DC~0))) (and (or (and (= ~NP~0 ~s~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (or (or (or (= ~SKIP1~0 ~NP~0) .cse1 .cse7 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse2 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse8 0) (<= 0 .cse8) (= 1 ~setEventCalled~0) .cse0))) (or .cse1 .cse7 (and .cse0 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6))) [2018-11-23 07:51:29,639 INFO L448 ceAbstractionStarter]: For program point L4115(lines 4115 4134) no Hoare annotation was computed. [2018-11-23 07:51:29,639 INFO L448 ceAbstractionStarter]: For program point L4140(lines 4140 4157) no Hoare annotation was computed. [2018-11-23 07:51:29,639 INFO L448 ceAbstractionStarter]: For program point L4091(lines 4091 4101) no Hoare annotation was computed. [2018-11-23 07:51:29,639 INFO L448 ceAbstractionStarter]: For program point L4091-2(lines 4090 4109) no Hoare annotation was computed. [2018-11-23 07:51:29,639 INFO L444 ceAbstractionStarter]: At program point L4116(lines 4115 4134) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= ~DC~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (not (= ~pended~0 1))) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (= ~SKIP2~0 ~DC~0))) (and (or (and (= ~NP~0 ~s~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (or (or (or (= ~SKIP1~0 ~NP~0) .cse1 .cse7 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse2 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse8 0) (<= 0 .cse8) (= 1 ~setEventCalled~0) .cse0))) (or .cse1 .cse7 (and .cse0 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6))) [2018-11-23 07:51:29,639 INFO L448 ceAbstractionStarter]: For program point L4149(lines 4149 4156) no Hoare annotation was computed. [2018-11-23 07:51:29,639 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 4080 4161) the Hoare annotation is: (let ((.cse8 (not (= ~pended~0 1)))) (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse0 (and (= ~NP~0 ~s~0) .cse8)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (or (or (or (= ~SKIP1~0 ~NP~0) .cse1 .cse7 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse2 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) .cse0) (or .cse1 .cse7 (and .cse8 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6)))) [2018-11-23 07:51:29,645 INFO L448 ceAbstractionStarter]: For program point L4141(lines 4141 4147) no Hoare annotation was computed. [2018-11-23 07:51:29,645 INFO L444 ceAbstractionStarter]: At program point L4104(line 4104) the Hoare annotation is: (let ((.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse7 (not (= ~compRegistered~0 0))) (.cse5 (= ~SKIP2~0 ~DC~0))) (and (or (let ((.cse0 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (<= .cse0 0) (<= 0 .cse0) (= ~NP~0 ~s~0) (= 1 ~setEventCalled~0) (not (= ~pended~0 1)))) (or (or (or (= ~SKIP1~0 ~NP~0) .cse1 .cse2 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse5) .cse6 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259))) (or .cse1 .cse2 .cse3 .cse4 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5) (or .cse1 .cse6 .cse3 .cse4 .cse7 .cse5))) [2018-11-23 07:51:29,646 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 4080 4161) no Hoare annotation was computed. [2018-11-23 07:51:29,646 INFO L444 ceAbstractionStarter]: At program point L4154(line 4154) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= ~SKIP2~0 ~IPC~0)) (.cse3 (= 1 |old(~pended~0)|)) (.cse6 (not (= ~compRegistered~0 0))) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse4) .cse5 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or .cse0 .cse5 .cse2 .cse3 .cse6 .cse4))) [2018-11-23 07:51:29,646 INFO L448 ceAbstractionStarter]: For program point L4154-1(lines 4136 4158) no Hoare annotation was computed. [2018-11-23 07:51:29,646 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 4080 4161) no Hoare annotation was computed. [2018-11-23 07:51:29,646 INFO L444 ceAbstractionStarter]: At program point L4113(lines 4112 4135) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= ~DC~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (not (= ~pended~0 1))) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (= ~SKIP2~0 ~DC~0))) (and (or (and (= ~NP~0 ~s~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (or (or (or (= ~SKIP1~0 ~NP~0) .cse1 .cse7 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse2 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~s~0 ~MPR1~0) (<= .cse8 0) (<= 0 .cse8) (= 1 ~setEventCalled~0) .cse0))) (or .cse1 .cse7 (and .cse0 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6))) [2018-11-23 07:51:29,646 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 4120 4132) no Hoare annotation was computed. [2018-11-23 07:51:29,646 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 4120 4132) no Hoare annotation was computed. [2018-11-23 07:51:29,646 INFO L448 ceAbstractionStarter]: For program point L4093-1(line 4093) no Hoare annotation was computed. [2018-11-23 07:51:29,650 INFO L444 ceAbstractionStarter]: At program point L4093(line 4093) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= ~SKIP2~0 ~IPC~0)) (.cse3 (= 1 |old(~pended~0)|)) (.cse6 (not (= ~compRegistered~0 0))) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse4) .cse5 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or .cse0 .cse5 .cse2 .cse3 .cse6 .cse4))) [2018-11-23 07:51:29,650 INFO L444 ceAbstractionStarter]: At program point L4098(line 4098) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= ~SKIP2~0 ~IPC~0)) (.cse3 (= 1 |old(~pended~0)|)) (.cse6 (not (= ~compRegistered~0 0))) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse4) .cse5 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or .cse0 .cse5 .cse2 .cse3 .cse6 .cse4))) [2018-11-23 07:51:29,651 INFO L444 ceAbstractionStarter]: At program point L4131(lines 4089 4160) the Hoare annotation is: (let ((.cse5 (not (= ~compRegistered~0 0))) (.cse1 (= ~DC~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse6 (= ~SKIP2~0 ~DC~0)) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= ~pended~0 1)))) (and (or (and (= ~NP~0 ~s~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 (and .cse0 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6) (let ((.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse8 (= ~s~0 ~MPR1~0)) (.cse9 (<= .cse13 0)) (.cse10 (<= 0 .cse13)) (.cse11 (= 1 ~setEventCalled~0)) (.cse12 (and (not (= ~IPC~0 ~DC~0)) (not (= ~IPC~0 ~SKIP2~0)) (not (= ~DC~0 ~SKIP2~0)) .cse0))) (or (or (or (or (= ~SKIP1~0 ~NP~0) .cse1 .cse7 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse2 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (or (and .cse8 .cse9 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse10 .cse11 .cse12) (and .cse8 .cse9 .cse10 (= 0 IofCallDriver_~returnVal2~0) .cse11 .cse12)) (and (and .cse8 .cse9 .cse10 .cse11 .cse12) (= IofCallDriver_~returnVal2~0 259))))))) [2018-11-23 07:51:29,651 INFO L448 ceAbstractionStarter]: For program point L2562-1(lines 2562 2566) no Hoare annotation was computed. [2018-11-23 07:51:29,651 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 2528 2595) no Hoare annotation was computed. [2018-11-23 07:51:29,651 INFO L448 ceAbstractionStarter]: For program point L2581(lines 2581 2592) no Hoare annotation was computed. [2018-11-23 07:51:29,651 INFO L448 ceAbstractionStarter]: For program point L2581-2(lines 2581 2592) no Hoare annotation was computed. [2018-11-23 07:51:29,651 INFO L448 ceAbstractionStarter]: For program point L2544(lines 2544 2548) no Hoare annotation was computed. [2018-11-23 07:51:29,651 INFO L448 ceAbstractionStarter]: For program point L2567(lines 2567 2575) no Hoare annotation was computed. [2018-11-23 07:51:29,651 INFO L448 ceAbstractionStarter]: For program point L2567-2(lines 2567 2575) no Hoare annotation was computed. [2018-11-23 07:51:29,651 INFO L448 ceAbstractionStarter]: For program point L2557-1(line 2557) no Hoare annotation was computed. [2018-11-23 07:51:29,651 INFO L451 ceAbstractionStarter]: At program point L2557(line 2557) the Hoare annotation is: true [2018-11-23 07:51:29,651 INFO L451 ceAbstractionStarter]: At program point L2586(line 2586) the Hoare annotation is: true [2018-11-23 07:51:29,661 INFO L448 ceAbstractionStarter]: For program point L2555(lines 2555 2561) no Hoare annotation was computed. [2018-11-23 07:51:29,661 INFO L448 ceAbstractionStarter]: For program point L2553-1(line 2553) no Hoare annotation was computed. [2018-11-23 07:51:29,661 INFO L451 ceAbstractionStarter]: At program point L2553(line 2553) the Hoare annotation is: true [2018-11-23 07:51:29,661 INFO L448 ceAbstractionStarter]: For program point L2555-2(lines 2537 2594) no Hoare annotation was computed. [2018-11-23 07:51:29,661 INFO L448 ceAbstractionStarter]: For program point L2586-1(lines 2582 2588) no Hoare annotation was computed. [2018-11-23 07:51:29,661 INFO L448 ceAbstractionStarter]: For program point L2551-1(line 2551) no Hoare annotation was computed. [2018-11-23 07:51:29,661 INFO L448 ceAbstractionStarter]: For program point L2582(lines 2582 2588) no Hoare annotation was computed. [2018-11-23 07:51:29,661 INFO L451 ceAbstractionStarter]: At program point L2551(line 2551) the Hoare annotation is: true [2018-11-23 07:51:29,661 INFO L448 ceAbstractionStarter]: For program point L2576(lines 2576 2580) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 2528 2595) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L448 ceAbstractionStarter]: For program point L2576-2(lines 2576 2580) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L451 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 2528 2595) the Hoare annotation is: true [2018-11-23 07:51:29,662 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 2253 2271) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L444 ceAbstractionStarter]: At program point L2270(lines 2253 2271) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= ~compRegistered~0 1) (= ~DC~0 ~s~0) (= ~routine~0 0) (not (= 259 DiskPerfDispatchPnp_~status~1)) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,662 INFO L448 ceAbstractionStarter]: For program point L2266(line 2266) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 2238 2277) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 2238 2277) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L448 ceAbstractionStarter]: For program point L2261(line 2261) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L448 ceAbstractionStarter]: For program point L2256(line 2256) no Hoare annotation was computed. [2018-11-23 07:51:29,662 INFO L444 ceAbstractionStarter]: At program point L2252(lines 2251 2272) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,662 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 2238 2277) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point L2248(lines 2248 2273) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L444 ceAbstractionStarter]: At program point L2249(lines 2248 2273) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,668 INFO L444 ceAbstractionStarter]: At program point L2246(lines 2245 2274) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point L2245(lines 2245 2274) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 2253 2271) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0)) [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 11 16) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L451 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 11 16) the Hoare annotation is: true [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 11 16) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L451 ceAbstractionStarter]: At program point InterlockedDecrementENTRY(lines 1530 1532) the Hoare annotation is: true [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point InterlockedDecrementEXIT(lines 1530 1532) no Hoare annotation was computed. [2018-11-23 07:51:29,668 INFO L448 ceAbstractionStarter]: For program point InterlockedDecrementFINAL(lines 1530 1532) no Hoare annotation was computed. [2018-11-23 07:51:29,669 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 3645 3657) no Hoare annotation was computed. [2018-11-23 07:51:29,669 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 3645 3657) no Hoare annotation was computed. [2018-11-23 07:51:29,669 INFO L451 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 3645 3657) the Hoare annotation is: true [2018-11-23 07:51:29,669 INFO L448 ceAbstractionStarter]: For program point IoWriteErrorLogEntryEXIT(line 1676) no Hoare annotation was computed. [2018-11-23 07:51:29,673 INFO L451 ceAbstractionStarter]: At program point IoWriteErrorLogEntryENTRY(line 1676) the Hoare annotation is: true [2018-11-23 07:51:29,673 INFO L448 ceAbstractionStarter]: For program point IoWriteErrorLogEntryFINAL(line 1676) no Hoare annotation was computed. [2018-11-23 07:51:29,673 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,673 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= ~s~0 ~UNLOADED~0) (= ~NP~0 ~MPR1~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~IPC~0 ~s~0) (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) [2018-11-23 07:51:29,673 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 07:51:29,673 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 07:51:29,673 INFO L444 ceAbstractionStarter]: At program point L2748(line 2748) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,673 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 2739 2752) no Hoare annotation was computed. [2018-11-23 07:51:29,674 INFO L448 ceAbstractionStarter]: For program point L2748-1(line 2748) no Hoare annotation was computed. [2018-11-23 07:51:29,674 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 2739 2752) no Hoare annotation was computed. [2018-11-23 07:51:29,674 INFO L444 ceAbstractionStarter]: At program point DiskPerfShutdownFlushENTRY(lines 2739 2752) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 07:51:29,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:51:29 BoogieIcfgContainer [2018-11-23 07:51:29,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:51:29,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:51:29,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:51:29,728 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:51:29,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:46:08" (3/4) ... [2018-11-23 07:51:29,735 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 07:51:29,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfLogError [2018-11-23 07:51:29,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-23 07:51:29,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoWMIRegistrationControl [2018-11-23 07:51:29,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeQueryPerformanceCounter [2018-11-23 07:51:29,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeQuerySystemTime [2018-11-23 07:51:29,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 07:51:29,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedIncrement [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedExchange [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoAllocateErrorLogEntry [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 07:51:29,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfAddCounters [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-11-23 07:51:29,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-11-23 07:51:29,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 07:51:29,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_guard [2018-11-23 07:51:29,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedDecrement [2018-11-23 07:51:29,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-11-23 07:51:29,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoWriteErrorLogEntry [2018-11-23 07:51:29,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-11-23 07:51:29,792 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1542 nodes and edges [2018-11-23 07:51:29,796 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 844 nodes and edges [2018-11-23 07:51:29,800 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 331 nodes and edges [2018-11-23 07:51:29,802 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 239 nodes and edges [2018-11-23 07:51:29,805 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2018-11-23 07:51:29,808 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-23 07:51:29,810 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 07:51:29,813 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 07:51:29,848 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || ((((((((((((0 == compRegistered && s == UNLOADED) && IPC == s) && \old(s) == MPR1) && DC == s) && s == SKIP2) && routine == 0) && 0 == myStatus) && NP == s) && MPR3 == s) && NP == \old(s)) && !(pended == 1)) && SKIP1 == s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || ((((((((((((0 == compRegistered && s == UNLOADED) && IPC == s) && \old(s) == MPR1) && DC == s) && s == SKIP2) && routine == 0) && 0 == myStatus) && NP == s) && MPR3 == s) && NP == \old(s)) && !(pended == 1)) && SKIP1 == s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,854 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(259 == status) && !(IPC == SKIP2)) && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1)) || !(\old(myStatus) == 0)) || (((((lowerDriverReturn == status && !(DC == SKIP2)) && !(s == SKIP2)) && !(DC == s)) && !(pended == 1)) && IPC == s)) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((0 == status && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || (((((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && !(DC == IPC)) && !(IPC == SKIP2)) && SKIP2 == s) && !(DC == s)) && !(pended == 1)) && !(SKIP1 == NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(259 == status) && !(IPC == SKIP2)) && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1)) || !(\old(myStatus) == 0)) || s == UNLOADED) || (((((lowerDriverReturn == status && !(DC == SKIP2)) && !(s == SKIP2)) && !(DC == s)) && !(pended == 1)) && IPC == s)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((0 == status && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || (((((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && !(DC == IPC)) && !(IPC == SKIP2)) && SKIP2 == s) && !(DC == s)) && !(pended == 1)) && !(SKIP1 == NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(259 == status) && !(IPC == SKIP2)) && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1)) || ((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1)) && SKIP2 == s) && !(SKIP1 == NP))) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((lowerDriverReturn == status && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1)) && IPC == s)) || ((((0 == status && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s || ((((((!(\old(setEventCalled) == 1) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) || SKIP1 == NP) && ((NP == s && 1 == setEventCalled) || (((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) [2018-11-23 07:51:29,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s || ((((((!(\old(setEventCalled) == 1) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) || SKIP1 == NP) && ((NP == s && 1 == setEventCalled) || (((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) [2018-11-23 07:51:29,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC [2018-11-23 07:51:29,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((NP == s && !(pended == 1)) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || ((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && !(pended == 1)))) && (((((((DC == IPC || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || ((((!(IPC == DC) && 0 == compRegistered) && !(DC == SKIP2)) && NP == s) && !(pended == 1))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((NP == s && !(pended == 1)) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) && (((((((DC == IPC || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC)) && (((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || (((((s == MPR1 && compRetStatus + 1073741802 <= 0) && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1)) || (((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 == returnVal2) && 1 == setEventCalled) && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1))) || (((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1)) && returnVal2 == 259)) [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((NP == s && !(pended == 1)) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || ((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && !(pended == 1)))) && (((((((DC == IPC || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((NP == s && !(pended == 1)) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || ((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && !(pended == 1)))) && (((((((DC == IPC || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == compRegistered && !(DC == IPC)) && !(IPC == SKIP2)) && !(DC == SKIP2)) && NP == s) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,856 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((((((((!(MPR1 == SKIP1) && !(myStatus == 259)) && 0 == compRegistered) && !(DC == SKIP2)) && !(MPR1 == NP)) && !(IPC == DC)) && routine == 0) && !(IPC == SKIP2)) && NP == s) && !(MPR3 == NP)) && !(pended == 1)) && !(SKIP1 == NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(MPR1 == SKIP1) && 0 == compRegistered) && !(DC == IPC)) && !(IPC == SKIP2)) && !(DC == SKIP2)) && NP == s) && !(pended == 1)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(259 == status) && !(IPC == SKIP2)) && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1)) || !(\old(myStatus) == 0)) || (((((lowerDriverReturn == status && !(DC == SKIP2)) && !(s == SKIP2)) && !(DC == s)) && !(pended == 1)) && IPC == s)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((0 == status && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || (((((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && !(DC == IPC)) && !(IPC == SKIP2)) && SKIP2 == s) && !(DC == s)) && !(pended == 1)) && !(SKIP1 == NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == compRegistered && !(DC == IPC)) && !(IPC == SKIP2)) && !(DC == SKIP2)) && NP == s) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) [2018-11-23 07:51:29,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || 1 == \old(pended)) || NP == MPR3) || !(\old(compRegistered) == 0)) || NP == MPR1) || SKIP2 == DC) || ((((compRegistered == 1 && DC == s) && routine == 0) && !(259 == status)) && !(pended == 1)) [2018-11-23 07:51:29,858 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259 [2018-11-23 07:51:29,858 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\old(setEventCalled) == 1) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) || SKIP1 == NP) && ((NP == s && 1 == setEventCalled) || (((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) [2018-11-23 07:51:29,858 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || 1 == \old(pended)) || NP == MPR3) || !(\old(compRegistered) == 0)) || NP == MPR1) || SKIP2 == DC) || ((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && NP == s) && !(pended == 1)) [2018-11-23 07:51:29,859 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || 1 == \old(pended)) || NP == MPR3) || !(\old(compRegistered) == 0)) || NP == MPR1) || SKIP2 == DC) || ((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && NP == s) && !(pended == 1)) [2018-11-23 07:51:29,859 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || 1 == \old(pended)) || NP == MPR3) || !(\old(compRegistered) == 0)) || NP == MPR1) || SKIP2 == DC) || ((0 == compRegistered && NP == s) && !(pended == 1)) [2018-11-23 07:51:29,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((DC == IPC || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) || (NP == s && !(pended == 1)) [2018-11-23 07:51:29,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((DC == IPC || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) || (NP == s && !(pended == 1)) [2018-11-23 07:51:29,964 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5b9ef4fd-84ee-4714-b067-5a5eaadbcb40/bin-2019/uautomizer/witness.graphml [2018-11-23 07:51:29,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:51:29,965 INFO L168 Benchmark]: Toolchain (without parser) took 342632.78 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 952.1 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-23 07:51:29,966 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:51:29,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 974.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.1 MB in the beginning and 1.0 GB in the end (delta: -77.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:51:29,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:51:29,967 INFO L168 Benchmark]: Boogie Preprocessor took 147.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 980.8 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:51:29,967 INFO L168 Benchmark]: RCFGBuilder took 20444.14 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 583.5 MB). Free memory was 980.8 MB in the beginning and 915.0 MB in the end (delta: 65.8 MB). Peak memory consumption was 651.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:51:29,967 INFO L168 Benchmark]: TraceAbstraction took 320765.93 ms. Allocated memory was 1.8 GB in the beginning and 3.4 GB in the end (delta: 1.6 GB). Free memory was 897.8 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-11-23 07:51:29,967 INFO L168 Benchmark]: Witness Printer took 236.59 ms. Allocated memory is still 3.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 100.2 MB). Peak memory consumption was 100.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:51:29,969 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 974.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.1 MB in the beginning and 1.0 GB in the end (delta: -77.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 147.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 980.8 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 20444.14 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 583.5 MB). Free memory was 980.8 MB in the beginning and 915.0 MB in the end (delta: 65.8 MB). Peak memory consumption was 651.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 320765.93 ms. Allocated memory was 1.8 GB in the beginning and 3.4 GB in the end (delta: 1.6 GB). Free memory was 897.8 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 236.59 ms. Allocated memory is still 3.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 100.2 MB). Peak memory consumption was 100.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2039]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3554]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(259 == status) && !(IPC == SKIP2)) && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1)) || !(\old(myStatus) == 0)) || (((((lowerDriverReturn == status && !(DC == SKIP2)) && !(s == SKIP2)) && !(DC == s)) && !(pended == 1)) && IPC == s)) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((0 == status && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || (((((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && !(DC == IPC)) && !(IPC == SKIP2)) && SKIP2 == s) && !(DC == s)) && !(pended == 1)) && !(SKIP1 == NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 3496]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((((((((!(MPR1 == SKIP1) && !(myStatus == 259)) && 0 == compRegistered) && !(DC == SKIP2)) && !(MPR1 == NP)) && !(IPC == DC)) && routine == 0) && !(IPC == SKIP2)) && NP == s) && !(MPR3 == NP)) && !(pended == 1)) && !(SKIP1 == NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: ((((((((NP == s && !(pended == 1)) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) && (((((((DC == IPC || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC)) && (((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || (((((s == MPR1 && compRetStatus + 1073741802 <= 0) && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1)) || (((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 == returnVal2) && 1 == setEventCalled) && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1))) || (((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1)) && returnVal2 == 259)) - InvariantResult [Line: 2634]: Loop Invariant Derived loop invariant: (((((DC == IPC || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) || (NP == s && !(pended == 1)) - InvariantResult [Line: 4435]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC - InvariantResult [Line: 2635]: Loop Invariant Derived loop invariant: (((((DC == IPC || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) || (NP == s && !(pended == 1)) - InvariantResult [Line: 2251]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || 1 == \old(pended)) || NP == MPR3) || !(\old(compRegistered) == 0)) || NP == MPR1) || SKIP2 == DC) || ((0 == compRegistered && NP == s) && !(pended == 1)) - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3505]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2248]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || 1 == \old(pended)) || NP == MPR3) || !(\old(compRegistered) == 0)) || NP == MPR1) || SKIP2 == DC) || ((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && NP == s) && !(pended == 1)) - InvariantResult [Line: 4112]: Loop Invariant Derived loop invariant: ((((((((NP == s && !(pended == 1)) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || ((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && !(pended == 1)))) && (((((((DC == IPC || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) - InvariantResult [Line: 3490]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || ((((!(IPC == DC) && 0 == compRegistered) && !(DC == SKIP2)) && NP == s) && !(pended == 1))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 4299]: Loop Invariant Derived loop invariant: (NP == s || ((((((!(\old(setEventCalled) == 1) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) || SKIP1 == NP) && ((NP == s && 1 == setEventCalled) || (((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3499]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(MPR1 == SKIP1) && 0 == compRegistered) && !(DC == IPC)) && !(IPC == SKIP2)) && !(DC == SKIP2)) && NP == s) && !(pended == 1)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 4462]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC - InvariantResult [Line: 4118]: Loop Invariant Derived loop invariant: ((((((((NP == s && !(pended == 1)) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || ((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && !(pended == 1)))) && (((((((DC == IPC || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) - InvariantResult [Line: 2939]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259 - InvariantResult [Line: 3330]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || ((((((((((((0 == compRegistered && s == UNLOADED) && IPC == s) && \old(s) == MPR1) && DC == s) && s == SKIP2) && routine == 0) && 0 == myStatus) && NP == s) && MPR3 == s) && NP == \old(s)) && !(pended == 1)) && SKIP1 == s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 3804]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3562]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(259 == status) && !(IPC == SKIP2)) && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1)) || !(\old(myStatus) == 0)) || s == UNLOADED) || (((((lowerDriverReturn == status && !(DC == SKIP2)) && !(s == SKIP2)) && !(DC == s)) && !(pended == 1)) && IPC == s)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((0 == status && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || (((((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && !(DC == IPC)) && !(IPC == SKIP2)) && SKIP2 == s) && !(DC == s)) && !(pended == 1)) && !(SKIP1 == NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 3493]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == compRegistered && !(DC == IPC)) && !(IPC == SKIP2)) && !(DC == SKIP2)) && NP == s) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 4274]: Loop Invariant Derived loop invariant: (((((((!(\old(setEventCalled) == 1) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) || SKIP1 == NP) && ((NP == s && 1 == setEventCalled) || (((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) - InvariantResult [Line: 4468]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2253]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || 1 == \old(pended)) || NP == MPR3) || !(\old(compRegistered) == 0)) || NP == MPR1) || SKIP2 == DC) || ((((compRegistered == 1 && DC == s) && routine == 0) && !(259 == status)) && !(pended == 1)) - InvariantResult [Line: 3466]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(259 == status) && !(IPC == SKIP2)) && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1)) || !(\old(myStatus) == 0)) || (((((lowerDriverReturn == status && !(DC == SKIP2)) && !(s == SKIP2)) && !(DC == s)) && !(pended == 1)) && IPC == s)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((0 == status && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || (((((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && !(DC == IPC)) && !(IPC == SKIP2)) && SKIP2 == s) && !(DC == s)) && !(pended == 1)) && !(SKIP1 == NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 3576]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(259 == status) && !(IPC == SKIP2)) && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1)) || ((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1)) && SKIP2 == s) && !(SKIP1 == NP))) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((lowerDriverReturn == status && ((!(IPC == DC) && !(IPC == SKIP2)) && !(DC == SKIP2)) && !(pended == 1)) && IPC == s)) || ((((0 == status && !(s == SKIP2)) && s == DC) && !(IPC == s)) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 4465]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC - InvariantResult [Line: 3502]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == compRegistered && !(DC == IPC)) && !(IPC == SKIP2)) && !(DC == SKIP2)) && NP == s) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 2245]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || 1 == \old(pended)) || NP == MPR3) || !(\old(compRegistered) == 0)) || NP == MPR1) || SKIP2 == DC) || ((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && NP == s) && !(pended == 1)) - InvariantResult [Line: 4115]: Loop Invariant Derived loop invariant: ((((((((NP == s && !(pended == 1)) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || ((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && !(pended == 1)))) && (((((((DC == IPC || SKIP1 == MPR1) || (!(pended == 1) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) - InvariantResult [Line: 4296]: Loop Invariant Derived loop invariant: (NP == s || ((((((!(\old(setEventCalled) == 1) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) || SKIP1 == NP) && ((NP == s && 1 == setEventCalled) || (((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) - InvariantResult [Line: 3256]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || ((((((((((((0 == compRegistered && s == UNLOADED) && IPC == s) && \old(s) == MPR1) && DC == s) && s == SKIP2) && routine == 0) && 0 == myStatus) && NP == s) && MPR3 == s) && NP == \old(s)) && !(pended == 1)) && SKIP1 == s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 41 procedures, 445 locations, 1 error locations. SAFE Result, 320.6s OverallTime, 47 OverallIterations, 4 TraceHistogramMax, 260.4s AutomataDifference, 0.0s DeadEndRemovalTime, 18.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 21355 SDtfs, 13435 SDslu, 49793 SDs, 0 SdLazy, 21584 SolverSat, 3476 SolverUnsat, 115 SolverUnknown, 0 SolverNotchecked, 252.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 861 GetRequests, 539 SyntacticMatches, 10 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3005occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 47 MinimizatonAttempts, 6486 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 164 LocationsWithAnnotation, 9691 PreInvPairs, 10275 NumberOfFragments, 7744 HoareAnnotationTreeSize, 9691 FomulaSimplifications, 295881 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 164 FomulaSimplificationsInter, 131095 FormulaSimplificationTreeSizeReductionInter, 16.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.9s SsaConstructionTime, 27.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 4935 NumberOfCodeBlocks, 4935 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 4886 ConstructedInterpolants, 0 QuantifiedInterpolants, 868152 SizeOfPredicates, 2 NumberOfNonLiveVariables, 12969 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 49 InterpolantComputations, 46 PerfectInterpolantSequences, 1030/1044 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...