./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 564a601a6273fd55bda5923edf4b35a694c899ec .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 03:14:19,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 03:14:19,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 03:14:19,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 03:14:19,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 03:14:19,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 03:14:19,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 03:14:19,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 03:14:19,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 03:14:19,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 03:14:19,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 03:14:19,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 03:14:19,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 03:14:19,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 03:14:19,334 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 03:14:19,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 03:14:19,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 03:14:19,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 03:14:19,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 03:14:19,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 03:14:19,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 03:14:19,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 03:14:19,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 03:14:19,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 03:14:19,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 03:14:19,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 03:14:19,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 03:14:19,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 03:14:19,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 03:14:19,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 03:14:19,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 03:14:19,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 03:14:19,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 03:14:19,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 03:14:19,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 03:14:19,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 03:14:19,348 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 03:14:19,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 03:14:19,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 03:14:19,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 03:14:19,356 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 03:14:19,356 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 03:14:19,356 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 03:14:19,356 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 03:14:19,357 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 03:14:19,357 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 03:14:19,357 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 03:14:19,357 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 03:14:19,357 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 03:14:19,357 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 03:14:19,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 03:14:19,357 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 03:14:19,358 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 03:14:19,358 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 03:14:19,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 03:14:19,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 03:14:19,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 03:14:19,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 03:14:19,358 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 03:14:19,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 03:14:19,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 03:14:19,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 03:14:19,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 03:14:19,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 03:14:19,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 03:14:19,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:14:19,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 03:14:19,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 03:14:19,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 03:14:19,360 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 03:14:19,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 03:14:19,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 03:14:19,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 03:14:19,360 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 564a601a6273fd55bda5923edf4b35a694c899ec [2018-12-03 03:14:19,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 03:14:19,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 03:14:19,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 03:14:19,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 03:14:19,394 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 03:14:19,394 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-03 03:14:19,427 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/data/4129d1158/c6052d06a9564f51ab8084089a6c4760/FLAGab8b385e9 [2018-12-03 03:14:19,859 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 03:14:19,859 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-03 03:14:19,866 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/data/4129d1158/c6052d06a9564f51ab8084089a6c4760/FLAGab8b385e9 [2018-12-03 03:14:19,874 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/data/4129d1158/c6052d06a9564f51ab8084089a6c4760 [2018-12-03 03:14:19,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 03:14:19,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 03:14:19,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 03:14:19,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 03:14:19,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 03:14:19,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:14:19" (1/1) ... [2018-12-03 03:14:19,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402e4aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:19, skipping insertion in model container [2018-12-03 03:14:19,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:14:19" (1/1) ... [2018-12-03 03:14:19,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 03:14:19,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 03:14:20,056 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:14:20,059 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 03:14:20,108 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:14:20,155 INFO L195 MainTranslator]: Completed translation [2018-12-03 03:14:20,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20 WrapperNode [2018-12-03 03:14:20,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 03:14:20,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 03:14:20,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 03:14:20,156 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 03:14:20,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 03:14:20,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 03:14:20,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 03:14:20,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 03:14:20,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... [2018-12-03 03:14:20,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 03:14:20,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 03:14:20,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 03:14:20,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 03:14:20,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-03 03:14:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-03 03:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 03:14:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 03:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-12-03 03:14:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-12-03 03:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-03 03:14:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-03 03:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-03 03:14:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-03 03:14:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-12-03 03:14:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-12-03 03:14:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-03 03:14:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-03 03:14:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-03 03:14:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-03 03:14:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-03 03:14:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-03 03:14:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-03 03:14:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-03 03:14:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-03 03:14:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-03 03:14:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-12-03 03:14:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-12-03 03:14:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-12-03 03:14:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-12-03 03:14:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-12-03 03:14:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-12-03 03:14:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-12-03 03:14:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-12-03 03:14:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-12-03 03:14:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-12-03 03:14:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-12-03 03:14:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-12-03 03:14:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-12-03 03:14:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-12-03 03:14:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-03 03:14:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-03 03:14:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-12-03 03:14:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-12-03 03:14:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-03 03:14:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-03 03:14:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-12-03 03:14:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-12-03 03:14:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-12-03 03:14:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-12-03 03:14:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-12-03 03:14:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-12-03 03:14:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 03:14:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 03:14:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 03:14:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 03:14:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-12-03 03:14:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-12-03 03:14:20,369 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 03:14:20,370 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 03:14:20,452 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 03:14:20,452 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 03:14:20,491 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 03:14:20,491 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 03:14:20,506 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 03:14:20,506 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 03:14:20,613 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 03:14:20,613 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 03:14:20,657 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 03:14:20,657 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 03:14:20,677 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 03:14:20,678 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 03:14:20,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:14:20 BoogieIcfgContainer [2018-12-03 03:14:20,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 03:14:20,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 03:14:20,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 03:14:20,680 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 03:14:20,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 03:14:19" (1/3) ... [2018-12-03 03:14:20,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3634359b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:14:20, skipping insertion in model container [2018-12-03 03:14:20,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:14:20" (2/3) ... [2018-12-03 03:14:20,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3634359b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:14:20, skipping insertion in model container [2018-12-03 03:14:20,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:14:20" (3/3) ... [2018-12-03 03:14:20,682 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-03 03:14:20,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 03:14:20,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 03:14:20,703 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 03:14:20,722 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 03:14:20,723 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 03:14:20,723 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 03:14:20,723 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 03:14:20,723 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 03:14:20,723 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 03:14:20,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 03:14:20,723 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 03:14:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2018-12-03 03:14:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 03:14:20,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:20,743 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] [2018-12-03 03:14:20,744 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:20,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2018-12-03 03:14:20,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:20,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:20,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:20,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:20,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:20,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:20,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:20,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:20,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:20,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:20,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:20,882 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2018-12-03 03:14:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:20,973 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2018-12-03 03:14:20,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:20,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 03:14:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:20,982 INFO L225 Difference]: With dead ends: 537 [2018-12-03 03:14:20,982 INFO L226 Difference]: Without dead ends: 287 [2018-12-03 03:14:20,985 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-12-03 03:14:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-03 03:14:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-12-03 03:14:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-12-03 03:14:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2018-12-03 03:14:21,024 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2018-12-03 03:14:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:21,025 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2018-12-03 03:14:21,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2018-12-03 03:14:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 03:14:21,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:21,026 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] [2018-12-03 03:14:21,026 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:21,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash -415593342, now seen corresponding path program 1 times [2018-12-03 03:14:21,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:21,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:21,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:21,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:21,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:21,096 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2018-12-03 03:14:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:21,209 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2018-12-03 03:14:21,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:21,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-03 03:14:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:21,213 INFO L225 Difference]: With dead ends: 637 [2018-12-03 03:14:21,213 INFO L226 Difference]: Without dead ends: 454 [2018-12-03 03:14:21,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-03 03:14:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2018-12-03 03:14:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-12-03 03:14:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2018-12-03 03:14:21,238 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2018-12-03 03:14:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:21,239 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2018-12-03 03:14:21,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2018-12-03 03:14:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 03:14:21,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:21,240 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-12-03 03:14:21,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:21,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1358856561, now seen corresponding path program 1 times [2018-12-03 03:14:21,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:21,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:21,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:21,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:21,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:21,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:21,284 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2018-12-03 03:14:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:21,320 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2018-12-03 03:14:21,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:21,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 03:14:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:21,325 INFO L225 Difference]: With dead ends: 963 [2018-12-03 03:14:21,325 INFO L226 Difference]: Without dead ends: 646 [2018-12-03 03:14:21,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-12-03 03:14:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-12-03 03:14:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2018-12-03 03:14:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-12-03 03:14:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2018-12-03 03:14:21,362 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2018-12-03 03:14:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:21,362 INFO L480 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2018-12-03 03:14:21,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2018-12-03 03:14:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 03:14:21,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:21,364 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] [2018-12-03 03:14:21,364 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:21,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2018-12-03 03:14:21,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:21,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:21,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:21,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:21,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:21,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:21,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:21,424 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2018-12-03 03:14:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:21,480 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2018-12-03 03:14:21,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:21,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 03:14:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:21,483 INFO L225 Difference]: With dead ends: 621 [2018-12-03 03:14:21,483 INFO L226 Difference]: Without dead ends: 617 [2018-12-03 03:14:21,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-03 03:14:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2018-12-03 03:14:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-03 03:14:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2018-12-03 03:14:21,504 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2018-12-03 03:14:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:21,505 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2018-12-03 03:14:21,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2018-12-03 03:14:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 03:14:21,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:21,506 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] [2018-12-03 03:14:21,507 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:21,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash 185749717, now seen corresponding path program 1 times [2018-12-03 03:14:21,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:21,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:21,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:21,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:21,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:21,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:21,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:21,536 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2018-12-03 03:14:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:21,586 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2018-12-03 03:14:21,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:21,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 03:14:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:21,590 INFO L225 Difference]: With dead ends: 1072 [2018-12-03 03:14:21,590 INFO L226 Difference]: Without dead ends: 1053 [2018-12-03 03:14:21,591 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-12-03 03:14:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2018-12-03 03:14:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2018-12-03 03:14:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-12-03 03:14:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2018-12-03 03:14:21,620 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2018-12-03 03:14:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:21,620 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2018-12-03 03:14:21,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2018-12-03 03:14:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 03:14:21,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:21,621 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] [2018-12-03 03:14:21,622 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:21,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:21,622 INFO L82 PathProgramCache]: Analyzing trace with hash 171404808, now seen corresponding path program 1 times [2018-12-03 03:14:21,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:21,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:21,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:21,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:21,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:21,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:21,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:21,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:21,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:21,647 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2018-12-03 03:14:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:21,709 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2018-12-03 03:14:21,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:21,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 03:14:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:21,714 INFO L225 Difference]: With dead ends: 1050 [2018-12-03 03:14:21,714 INFO L226 Difference]: Without dead ends: 1045 [2018-12-03 03:14:21,715 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-12-03 03:14:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-12-03 03:14:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2018-12-03 03:14:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-12-03 03:14:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2018-12-03 03:14:21,754 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2018-12-03 03:14:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:21,755 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2018-12-03 03:14:21,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2018-12-03 03:14:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 03:14:21,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:21,756 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] [2018-12-03 03:14:21,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:21,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1471308180, now seen corresponding path program 1 times [2018-12-03 03:14:21,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:21,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:21,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:21,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:21,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:14:21,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:21,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:14:21,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:14:21,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:21,786 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2018-12-03 03:14:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:21,824 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2018-12-03 03:14:21,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:14:21,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-03 03:14:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:21,829 INFO L225 Difference]: With dead ends: 1058 [2018-12-03 03:14:21,829 INFO L226 Difference]: Without dead ends: 1036 [2018-12-03 03:14:21,830 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-12-03 03:14:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-12-03 03:14:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2018-12-03 03:14:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-12-03 03:14:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2018-12-03 03:14:21,872 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2018-12-03 03:14:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:21,872 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2018-12-03 03:14:21,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:14:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2018-12-03 03:14:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 03:14:21,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:21,873 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-12-03 03:14:21,873 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:21,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:21,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1601291379, now seen corresponding path program 1 times [2018-12-03 03:14:21,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:21,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:21,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:21,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:21,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:21,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:21,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:21,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:21,910 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2018-12-03 03:14:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:21,944 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2018-12-03 03:14:21,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:21,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-03 03:14:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:21,946 INFO L225 Difference]: With dead ends: 1448 [2018-12-03 03:14:21,946 INFO L226 Difference]: Without dead ends: 578 [2018-12-03 03:14:21,949 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-12-03 03:14:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-12-03 03:14:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2018-12-03 03:14:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-03 03:14:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2018-12-03 03:14:21,966 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2018-12-03 03:14:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:21,966 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2018-12-03 03:14:21,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2018-12-03 03:14:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 03:14:21,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:21,967 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] [2018-12-03 03:14:21,967 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:21,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2018-12-03 03:14:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:21,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:22,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:22,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:14:22,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:22,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:14:22,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:14:22,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:22,006 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 5 states. [2018-12-03 03:14:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:22,210 INFO L93 Difference]: Finished difference Result 586 states and 829 transitions. [2018-12-03 03:14:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:14:22,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-03 03:14:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:22,213 INFO L225 Difference]: With dead ends: 586 [2018-12-03 03:14:22,213 INFO L226 Difference]: Without dead ends: 580 [2018-12-03 03:14:22,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-12-03 03:14:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-12-03 03:14:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-03 03:14:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2018-12-03 03:14:22,230 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2018-12-03 03:14:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:22,230 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2018-12-03 03:14:22,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:14:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2018-12-03 03:14:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 03:14:22,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:22,231 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-12-03 03:14:22,232 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:22,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:22,232 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2018-12-03 03:14:22,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:22,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:22,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:22,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:14:22,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:22,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:14:22,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:14:22,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:22,276 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 5 states. [2018-12-03 03:14:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:22,479 INFO L93 Difference]: Finished difference Result 586 states and 828 transitions. [2018-12-03 03:14:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:14:22,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-03 03:14:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:22,481 INFO L225 Difference]: With dead ends: 586 [2018-12-03 03:14:22,481 INFO L226 Difference]: Without dead ends: 580 [2018-12-03 03:14:22,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-12-03 03:14:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-12-03 03:14:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-03 03:14:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2018-12-03 03:14:22,499 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2018-12-03 03:14:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:22,499 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2018-12-03 03:14:22,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:14:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2018-12-03 03:14:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 03:14:22,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:22,499 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-12-03 03:14:22,500 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:22,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2018-12-03 03:14:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:22,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:22,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:22,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:22,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:22,539 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2018-12-03 03:14:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:22,589 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2018-12-03 03:14:22,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:14:22,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-03 03:14:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:22,591 INFO L225 Difference]: With dead ends: 601 [2018-12-03 03:14:22,591 INFO L226 Difference]: Without dead ends: 576 [2018-12-03 03:14:22,592 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-12-03 03:14:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-12-03 03:14:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2018-12-03 03:14:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-12-03 03:14:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2018-12-03 03:14:22,609 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2018-12-03 03:14:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:22,609 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2018-12-03 03:14:22,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2018-12-03 03:14:22,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 03:14:22,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:22,610 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-12-03 03:14:22,610 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:22,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1921382045, now seen corresponding path program 1 times [2018-12-03 03:14:22,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:22,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:22,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:22,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:22,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:22,635 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2018-12-03 03:14:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:22,725 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2018-12-03 03:14:22,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:22,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-03 03:14:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:22,727 INFO L225 Difference]: With dead ends: 810 [2018-12-03 03:14:22,727 INFO L226 Difference]: Without dead ends: 802 [2018-12-03 03:14:22,728 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-12-03 03:14:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-12-03 03:14:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2018-12-03 03:14:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-12-03 03:14:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2018-12-03 03:14:22,749 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2018-12-03 03:14:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:22,750 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2018-12-03 03:14:22,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2018-12-03 03:14:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 03:14:22,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:22,750 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] [2018-12-03 03:14:22,750 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:22,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:22,751 INFO L82 PathProgramCache]: Analyzing trace with hash 488507897, now seen corresponding path program 1 times [2018-12-03 03:14:22,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:22,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:22,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:22,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:22,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:14:22,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:22,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:14:22,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:14:22,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:14:22,786 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2018-12-03 03:14:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:22,900 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2018-12-03 03:14:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:14:22,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-03 03:14:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:22,902 INFO L225 Difference]: With dead ends: 719 [2018-12-03 03:14:22,902 INFO L226 Difference]: Without dead ends: 452 [2018-12-03 03:14:22,903 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-12-03 03:14:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-12-03 03:14:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2018-12-03 03:14:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-12-03 03:14:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2018-12-03 03:14:22,919 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2018-12-03 03:14:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:22,919 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2018-12-03 03:14:22,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:14:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2018-12-03 03:14:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 03:14:22,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:22,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] [2018-12-03 03:14:22,920 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:22,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:22,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1019702007, now seen corresponding path program 1 times [2018-12-03 03:14:22,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:22,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 03:14:22,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:22,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 03:14:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 03:14:22,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:14:22,963 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2018-12-03 03:14:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:23,059 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2018-12-03 03:14:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 03:14:23,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-12-03 03:14:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:23,060 INFO L225 Difference]: With dead ends: 447 [2018-12-03 03:14:23,061 INFO L226 Difference]: Without dead ends: 443 [2018-12-03 03:14:23,061 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-12-03 03:14:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-03 03:14:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-12-03 03:14:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-12-03 03:14:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2018-12-03 03:14:23,074 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2018-12-03 03:14:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:23,074 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2018-12-03 03:14:23,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 03:14:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2018-12-03 03:14:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 03:14:23,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:23,075 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-12-03 03:14:23,075 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:23,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1019425177, now seen corresponding path program 1 times [2018-12-03 03:14:23,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:23,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:23,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:23,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:23,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 03:14:23,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:23,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 03:14:23,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 03:14:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:14:23,123 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2018-12-03 03:14:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:23,179 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2018-12-03 03:14:23,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 03:14:23,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-12-03 03:14:23,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:23,181 INFO L225 Difference]: With dead ends: 760 [2018-12-03 03:14:23,181 INFO L226 Difference]: Without dead ends: 462 [2018-12-03 03:14:23,182 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-12-03 03:14:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-03 03:14:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2018-12-03 03:14:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-03 03:14:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2018-12-03 03:14:23,197 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2018-12-03 03:14:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:23,197 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2018-12-03 03:14:23,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 03:14:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2018-12-03 03:14:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 03:14:23,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:23,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, 1, 1] [2018-12-03 03:14:23,198 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:23,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:23,198 INFO L82 PathProgramCache]: Analyzing trace with hash 56692718, now seen corresponding path program 1 times [2018-12-03 03:14:23,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:23,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:23,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:23,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:23,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:14:23,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:23,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:14:23,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:14:23,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:23,257 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2018-12-03 03:14:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:23,567 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2018-12-03 03:14:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:14:23,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-03 03:14:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:23,570 INFO L225 Difference]: With dead ends: 580 [2018-12-03 03:14:23,570 INFO L226 Difference]: Without dead ends: 561 [2018-12-03 03:14:23,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-03 03:14:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2018-12-03 03:14:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-12-03 03:14:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2018-12-03 03:14:23,594 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2018-12-03 03:14:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:23,594 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2018-12-03 03:14:23,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:14:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2018-12-03 03:14:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 03:14:23,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:23,595 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] [2018-12-03 03:14:23,595 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:23,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash -420532410, now seen corresponding path program 1 times [2018-12-03 03:14:23,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:23,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:23,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:23,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:23,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 03:14:23,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:23,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 03:14:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 03:14:23,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:14:23,645 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2018-12-03 03:14:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:23,744 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2018-12-03 03:14:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 03:14:23,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-03 03:14:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:23,745 INFO L225 Difference]: With dead ends: 448 [2018-12-03 03:14:23,745 INFO L226 Difference]: Without dead ends: 417 [2018-12-03 03:14:23,745 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-12-03 03:14:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-03 03:14:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-03 03:14:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-03 03:14:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-12-03 03:14:23,759 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2018-12-03 03:14:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:23,759 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-12-03 03:14:23,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 03:14:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-12-03 03:14:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 03:14:23,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:23,759 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] [2018-12-03 03:14:23,760 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:23,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:23,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2018-12-03 03:14:23,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:23,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:23,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:23,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:23,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:23,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:23,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:23,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:23,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:23,798 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2018-12-03 03:14:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:23,831 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2018-12-03 03:14:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:23,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-03 03:14:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:23,833 INFO L225 Difference]: With dead ends: 432 [2018-12-03 03:14:23,833 INFO L226 Difference]: Without dead ends: 399 [2018-12-03 03:14:23,833 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-12-03 03:14:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-03 03:14:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-12-03 03:14:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-03 03:14:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2018-12-03 03:14:23,846 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2018-12-03 03:14:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:23,846 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2018-12-03 03:14:23,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-12-03 03:14:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 03:14:23,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:23,847 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] [2018-12-03 03:14:23,847 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:23,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2018-12-03 03:14:23,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:23,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:23,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:23,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:23,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 03:14:23,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:23,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 03:14:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 03:14:23,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:14:23,888 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2018-12-03 03:14:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:23,964 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2018-12-03 03:14:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 03:14:23,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-12-03 03:14:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:23,965 INFO L225 Difference]: With dead ends: 429 [2018-12-03 03:14:23,966 INFO L226 Difference]: Without dead ends: 408 [2018-12-03 03:14:23,966 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-12-03 03:14:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-12-03 03:14:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-12-03 03:14:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-03 03:14:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-12-03 03:14:23,979 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2018-12-03 03:14:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:23,980 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-12-03 03:14:23,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 03:14:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-12-03 03:14:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 03:14:23,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:23,980 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-12-03 03:14:23,981 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:23,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2018-12-03 03:14:23,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:23,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:23,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:23,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:24,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:24,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:14:24,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:24,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:14:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:14:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:14:24,007 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-12-03 03:14:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:24,029 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-12-03 03:14:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:14:24,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-03 03:14:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:24,030 INFO L225 Difference]: With dead ends: 436 [2018-12-03 03:14:24,031 INFO L226 Difference]: Without dead ends: 410 [2018-12-03 03:14:24,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-03 03:14:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-12-03 03:14:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-03 03:14:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-12-03 03:14:24,043 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-12-03 03:14:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:24,043 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-12-03 03:14:24,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:14:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-12-03 03:14:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 03:14:24,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:24,044 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-12-03 03:14:24,044 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:24,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2018-12-03 03:14:24,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:24,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:24,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:24,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:24,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:24,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:24,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 03:14:24,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:24,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:14:24,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:14:24,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:14:24,088 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-12-03 03:14:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:24,463 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-12-03 03:14:24,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 03:14:24,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-03 03:14:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:24,465 INFO L225 Difference]: With dead ends: 565 [2018-12-03 03:14:24,465 INFO L226 Difference]: Without dead ends: 511 [2018-12-03 03:14:24,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-03 03:14:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-03 03:14:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-12-03 03:14:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-12-03 03:14:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-12-03 03:14:24,484 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-12-03 03:14:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:24,484 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-12-03 03:14:24,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:14:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-12-03 03:14:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 03:14:24,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:24,484 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-12-03 03:14:24,485 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:24,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:24,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2018-12-03 03:14:24,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:24,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:24,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:24,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:24,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:24,511 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-12-03 03:14:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:24,593 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-12-03 03:14:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:24,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-03 03:14:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:24,596 INFO L225 Difference]: With dead ends: 673 [2018-12-03 03:14:24,596 INFO L226 Difference]: Without dead ends: 659 [2018-12-03 03:14:24,597 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-12-03 03:14:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-03 03:14:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-12-03 03:14:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-12-03 03:14:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-12-03 03:14:24,623 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-12-03 03:14:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:24,623 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-12-03 03:14:24,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-12-03 03:14:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 03:14:24,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:24,623 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-12-03 03:14:24,623 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:24,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2018-12-03 03:14:24,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:24,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:24,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:24,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:24,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:24,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:24,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 03:14:24,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:24,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 03:14:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 03:14:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:14:24,681 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-12-03 03:14:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:24,736 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-12-03 03:14:24,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 03:14:24,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-12-03 03:14:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:24,739 INFO L225 Difference]: With dead ends: 598 [2018-12-03 03:14:24,739 INFO L226 Difference]: Without dead ends: 574 [2018-12-03 03:14:24,740 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-12-03 03:14:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-12-03 03:14:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-12-03 03:14:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-12-03 03:14:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-12-03 03:14:24,767 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-12-03 03:14:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:24,767 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-12-03 03:14:24,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 03:14:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-12-03 03:14:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 03:14:24,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:24,768 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-12-03 03:14:24,768 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:24,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2018-12-03 03:14:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:24,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:24,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:24,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:14:24,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:24,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:14:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:14:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:24,798 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-12-03 03:14:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:25,105 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-12-03 03:14:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:14:25,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-03 03:14:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:25,108 INFO L225 Difference]: With dead ends: 660 [2018-12-03 03:14:25,108 INFO L226 Difference]: Without dead ends: 624 [2018-12-03 03:14:25,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-12-03 03:14:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-12-03 03:14:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-12-03 03:14:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-12-03 03:14:25,154 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-12-03 03:14:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:25,155 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-12-03 03:14:25,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:14:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-12-03 03:14:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 03:14:25,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:25,156 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] [2018-12-03 03:14:25,156 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:25,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:25,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1927592443, now seen corresponding path program 1 times [2018-12-03 03:14:25,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:25,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:25,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:25,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:25,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:25,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:25,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:25,189 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-12-03 03:14:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:25,247 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-12-03 03:14:25,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:25,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 03:14:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:25,250 INFO L225 Difference]: With dead ends: 955 [2018-12-03 03:14:25,250 INFO L226 Difference]: Without dead ends: 527 [2018-12-03 03:14:25,253 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-12-03 03:14:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-12-03 03:14:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-12-03 03:14:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-12-03 03:14:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-12-03 03:14:25,301 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-12-03 03:14:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:25,301 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-12-03 03:14:25,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-12-03 03:14:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 03:14:25,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:25,302 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-12-03 03:14:25,302 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:25,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1553434371, now seen corresponding path program 1 times [2018-12-03 03:14:25,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:25,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:25,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:25,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:25,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 03:14:25,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:25,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 03:14:25,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 03:14:25,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 03:14:25,360 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-12-03 03:14:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:25,459 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-12-03 03:14:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 03:14:25,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-03 03:14:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:25,461 INFO L225 Difference]: With dead ends: 529 [2018-12-03 03:14:25,461 INFO L226 Difference]: Without dead ends: 466 [2018-12-03 03:14:25,462 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-12-03 03:14:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-03 03:14:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-12-03 03:14:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-12-03 03:14:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-12-03 03:14:25,480 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-12-03 03:14:25,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:25,480 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-12-03 03:14:25,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 03:14:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-12-03 03:14:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 03:14:25,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:14:25,481 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:25,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:25,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1051956534, now seen corresponding path program 1 times [2018-12-03 03:14:25,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:25,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:25,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:25,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:25,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:25,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:25,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:25,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:25,517 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-12-03 03:14:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:25,566 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-12-03 03:14:25,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:25,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-03 03:14:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:25,569 INFO L225 Difference]: With dead ends: 918 [2018-12-03 03:14:25,570 INFO L226 Difference]: Without dead ends: 491 [2018-12-03 03:14:25,571 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-12-03 03:14:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-12-03 03:14:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-12-03 03:14:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-03 03:14:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-12-03 03:14:25,603 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-12-03 03:14:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:25,603 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-12-03 03:14:25,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-12-03 03:14:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 03:14:25,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:25,604 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-12-03 03:14:25,604 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:25,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:25,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1770735671, now seen corresponding path program 1 times [2018-12-03 03:14:25,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:25,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:14:25,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:25,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:14:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:14:25,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:14:25,633 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-12-03 03:14:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:25,717 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-12-03 03:14:25,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:14:25,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-03 03:14:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:25,720 INFO L225 Difference]: With dead ends: 730 [2018-12-03 03:14:25,720 INFO L226 Difference]: Without dead ends: 727 [2018-12-03 03:14:25,721 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-12-03 03:14:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-03 03:14:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-12-03 03:14:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-12-03 03:14:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-12-03 03:14:25,744 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-12-03 03:14:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:25,745 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-12-03 03:14:25,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:14:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-12-03 03:14:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 03:14:25,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:25,746 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-12-03 03:14:25,746 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:25,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1533013073, now seen corresponding path program 1 times [2018-12-03 03:14:25,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:25,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:25,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:25,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:25,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:25,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:25,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:25,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:25,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:25,832 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 6 states. [2018-12-03 03:14:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:25,868 INFO L93 Difference]: Finished difference Result 755 states and 1177 transitions. [2018-12-03 03:14:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:25,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-03 03:14:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:25,870 INFO L225 Difference]: With dead ends: 755 [2018-12-03 03:14:25,870 INFO L226 Difference]: Without dead ends: 312 [2018-12-03 03:14:25,871 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-12-03 03:14:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-03 03:14:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-12-03 03:14:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-03 03:14:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 435 transitions. [2018-12-03 03:14:25,889 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 435 transitions. Word has length 65 [2018-12-03 03:14:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:25,889 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 435 transitions. [2018-12-03 03:14:25,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 435 transitions. [2018-12-03 03:14:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 03:14:25,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:25,890 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-12-03 03:14:25,890 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:25,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:25,890 INFO L82 PathProgramCache]: Analyzing trace with hash -620931734, now seen corresponding path program 1 times [2018-12-03 03:14:25,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:25,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:25,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:25,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:25,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:25,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:14:25,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:25,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:14:25,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:14:25,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:25,928 INFO L87 Difference]: Start difference. First operand 312 states and 435 transitions. Second operand 5 states. [2018-12-03 03:14:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:26,077 INFO L93 Difference]: Finished difference Result 579 states and 830 transitions. [2018-12-03 03:14:26,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:14:26,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-03 03:14:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:26,079 INFO L225 Difference]: With dead ends: 579 [2018-12-03 03:14:26,079 INFO L226 Difference]: Without dead ends: 307 [2018-12-03 03:14:26,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-03 03:14:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-03 03:14:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-12-03 03:14:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-03 03:14:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-12-03 03:14:26,097 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-12-03 03:14:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:26,097 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-12-03 03:14:26,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:14:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-12-03 03:14:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 03:14:26,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:26,098 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] [2018-12-03 03:14:26,098 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:26,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash 438765614, now seen corresponding path program 1 times [2018-12-03 03:14:26,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:26,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:26,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:26,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:26,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:14:26,159 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:26,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:14:26,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:14:26,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:26,160 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 5 states. [2018-12-03 03:14:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:26,447 INFO L93 Difference]: Finished difference Result 669 states and 953 transitions. [2018-12-03 03:14:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:26,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-03 03:14:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:26,449 INFO L225 Difference]: With dead ends: 669 [2018-12-03 03:14:26,449 INFO L226 Difference]: Without dead ends: 405 [2018-12-03 03:14:26,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:14:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-12-03 03:14:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 363. [2018-12-03 03:14:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-03 03:14:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 503 transitions. [2018-12-03 03:14:26,467 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 503 transitions. Word has length 70 [2018-12-03 03:14:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:26,468 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 503 transitions. [2018-12-03 03:14:26,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:14:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 503 transitions. [2018-12-03 03:14:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 03:14:26,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:26,468 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] [2018-12-03 03:14:26,468 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:26,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1587959962, now seen corresponding path program 1 times [2018-12-03 03:14:26,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:26,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:26,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:26,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:26,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:26,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:26,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:26,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:26,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:26,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:26,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:26,529 INFO L87 Difference]: Start difference. First operand 363 states and 503 transitions. Second operand 6 states. [2018-12-03 03:14:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:26,574 INFO L93 Difference]: Finished difference Result 691 states and 982 transitions. [2018-12-03 03:14:26,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:26,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-03 03:14:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:26,576 INFO L225 Difference]: With dead ends: 691 [2018-12-03 03:14:26,577 INFO L226 Difference]: Without dead ends: 369 [2018-12-03 03:14:26,578 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-12-03 03:14:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-03 03:14:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-12-03 03:14:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-03 03:14:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 505 transitions. [2018-12-03 03:14:26,605 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 505 transitions. Word has length 72 [2018-12-03 03:14:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:26,606 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 505 transitions. [2018-12-03 03:14:26,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 505 transitions. [2018-12-03 03:14:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 03:14:26,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:26,607 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] [2018-12-03 03:14:26,607 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:26,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:26,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1286621045, now seen corresponding path program 1 times [2018-12-03 03:14:26,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:26,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:26,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:26,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:26,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:26,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:26,663 INFO L87 Difference]: Start difference. First operand 366 states and 505 transitions. Second operand 6 states. [2018-12-03 03:14:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:26,882 INFO L93 Difference]: Finished difference Result 642 states and 895 transitions. [2018-12-03 03:14:26,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:14:26,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-03 03:14:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:26,884 INFO L225 Difference]: With dead ends: 642 [2018-12-03 03:14:26,884 INFO L226 Difference]: Without dead ends: 337 [2018-12-03 03:14:26,885 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-12-03 03:14:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-03 03:14:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-12-03 03:14:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-03 03:14:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 441 transitions. [2018-12-03 03:14:26,901 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 441 transitions. Word has length 83 [2018-12-03 03:14:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:26,902 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 441 transitions. [2018-12-03 03:14:26,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 441 transitions. [2018-12-03 03:14:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 03:14:26,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:26,903 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] [2018-12-03 03:14:26,903 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:26,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:26,903 INFO L82 PathProgramCache]: Analyzing trace with hash -49085271, now seen corresponding path program 1 times [2018-12-03 03:14:26,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:26,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:26,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:26,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-03 03:14:26,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:26,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 03:14:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 03:14:26,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-03 03:14:26,996 INFO L87 Difference]: Start difference. First operand 329 states and 441 transitions. Second operand 15 states. [2018-12-03 03:14:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:27,099 INFO L93 Difference]: Finished difference Result 626 states and 853 transitions. [2018-12-03 03:14:27,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 03:14:27,099 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-12-03 03:14:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:27,100 INFO L225 Difference]: With dead ends: 626 [2018-12-03 03:14:27,100 INFO L226 Difference]: Without dead ends: 333 [2018-12-03 03:14:27,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-12-03 03:14:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-03 03:14:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2018-12-03 03:14:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-12-03 03:14:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 443 transitions. [2018-12-03 03:14:27,117 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 443 transitions. Word has length 92 [2018-12-03 03:14:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:27,117 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 443 transitions. [2018-12-03 03:14:27,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 03:14:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 443 transitions. [2018-12-03 03:14:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 03:14:27,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:27,118 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-12-03 03:14:27,118 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:27,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:27,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310540, now seen corresponding path program 1 times [2018-12-03 03:14:27,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:27,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:27,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:27,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:27,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:27,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:27,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 03:14:27,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:27,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 03:14:27,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 03:14:27,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 03:14:27,218 INFO L87 Difference]: Start difference. First operand 332 states and 443 transitions. Second operand 14 states. [2018-12-03 03:14:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:27,943 INFO L93 Difference]: Finished difference Result 364 states and 472 transitions. [2018-12-03 03:14:27,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 03:14:27,943 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-12-03 03:14:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:27,944 INFO L225 Difference]: With dead ends: 364 [2018-12-03 03:14:27,944 INFO L226 Difference]: Without dead ends: 322 [2018-12-03 03:14:27,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-12-03 03:14:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-03 03:14:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2018-12-03 03:14:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-12-03 03:14:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 423 transitions. [2018-12-03 03:14:27,960 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 423 transitions. Word has length 103 [2018-12-03 03:14:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:27,960 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 423 transitions. [2018-12-03 03:14:27,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 03:14:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 423 transitions. [2018-12-03 03:14:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 03:14:27,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:27,961 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] [2018-12-03 03:14:27,961 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:27,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:27,961 INFO L82 PathProgramCache]: Analyzing trace with hash -12169486, now seen corresponding path program 1 times [2018-12-03 03:14:27,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:27,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:27,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:27,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:28,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:28,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-03 03:14:28,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:28,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 03:14:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 03:14:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-03 03:14:28,061 INFO L87 Difference]: Start difference. First operand 317 states and 423 transitions. Second operand 15 states. [2018-12-03 03:14:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:28,161 INFO L93 Difference]: Finished difference Result 353 states and 468 transitions. [2018-12-03 03:14:28,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 03:14:28,161 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-12-03 03:14:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:28,162 INFO L225 Difference]: With dead ends: 353 [2018-12-03 03:14:28,162 INFO L226 Difference]: Without dead ends: 326 [2018-12-03 03:14:28,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-12-03 03:14:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-03 03:14:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-12-03 03:14:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 03:14:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-12-03 03:14:28,179 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 108 [2018-12-03 03:14:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:28,179 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-12-03 03:14:28,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 03:14:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-12-03 03:14:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 03:14:28,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:28,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-03 03:14:28,180 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:28,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1168498032, now seen corresponding path program 1 times [2018-12-03 03:14:28,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:28,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:28,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:28,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:28,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 03:14:28,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:28,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:14:28,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:28,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:14:28,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:14:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:14:28,223 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 5 states. [2018-12-03 03:14:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:28,403 INFO L93 Difference]: Finished difference Result 709 states and 929 transitions. [2018-12-03 03:14:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:28,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-12-03 03:14:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:28,405 INFO L225 Difference]: With dead ends: 709 [2018-12-03 03:14:28,405 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 03:14:28,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-12-03 03:14:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 03:14:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-12-03 03:14:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-03 03:14:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-12-03 03:14:28,425 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 132 [2018-12-03 03:14:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:28,426 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-12-03 03:14:28,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:14:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-12-03 03:14:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 03:14:28,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:28,427 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] [2018-12-03 03:14:28,427 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:28,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 587949524, now seen corresponding path program 1 times [2018-12-03 03:14:28,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:28,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:28,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:14:28,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:28,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 03:14:28,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:28,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 03:14:28,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 03:14:28,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 03:14:28,534 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 14 states. [2018-12-03 03:14:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:29,306 INFO L93 Difference]: Finished difference Result 405 states and 514 transitions. [2018-12-03 03:14:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 03:14:29,306 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-12-03 03:14:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:29,307 INFO L225 Difference]: With dead ends: 405 [2018-12-03 03:14:29,307 INFO L226 Difference]: Without dead ends: 341 [2018-12-03 03:14:29,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-12-03 03:14:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-12-03 03:14:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 275. [2018-12-03 03:14:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 03:14:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2018-12-03 03:14:29,321 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 120 [2018-12-03 03:14:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:29,322 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2018-12-03 03:14:29,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 03:14:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2018-12-03 03:14:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 03:14:29,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:29,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-03 03:14:29,322 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:29,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2028223534, now seen corresponding path program 1 times [2018-12-03 03:14:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:29,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:29,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 03:14:29,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:29,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:29,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:29,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:29,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:29,361 INFO L87 Difference]: Start difference. First operand 275 states and 333 transitions. Second operand 6 states. [2018-12-03 03:14:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:29,408 INFO L93 Difference]: Finished difference Result 468 states and 592 transitions. [2018-12-03 03:14:29,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:29,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-12-03 03:14:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:29,409 INFO L225 Difference]: With dead ends: 468 [2018-12-03 03:14:29,409 INFO L226 Difference]: Without dead ends: 322 [2018-12-03 03:14:29,410 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-12-03 03:14:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-03 03:14:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-12-03 03:14:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-03 03:14:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 320 transitions. [2018-12-03 03:14:29,424 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 320 transitions. Word has length 121 [2018-12-03 03:14:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:29,424 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 320 transitions. [2018-12-03 03:14:29,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 320 transitions. [2018-12-03 03:14:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 03:14:29,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:29,425 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, 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] [2018-12-03 03:14:29,425 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:29,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1150164970, now seen corresponding path program 1 times [2018-12-03 03:14:29,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:29,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 03:14:29,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:14:29,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:14:29,486 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-12-03 03:14:29,488 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [339], [341], [348], [352], [356], [358], [362], [364], [371], [373], [376], [379], [448], [449], [455], [461], [463], [465], [472], [474], [475], [476], [478], [481], [537], [542], [545], [548], [550], [556], [559], [567], [570], [572], [577], [580], [584], [592], [595], [598], [600], [611], [612], [613], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [747], [748], [749], [750], [769], [770], [773], [774], [775], [776], [777], [778], [779], [793], [794], [797], [798], [801], [802], [805], [811], [812], [813] [2018-12-03 03:14:29,516 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:14:29,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:14:30,085 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 03:14:30,086 INFO L272 AbstractInterpreter]: Visited 100 different actions 318 times. Merged at 21 different actions 52 times. Never widened. Performed 6028 root evaluator evaluations with a maximum evaluation depth of 9. Performed 6028 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 5 fixpoints after 1 different actions. Largest state had 98 variables. [2018-12-03 03:14:30,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:30,090 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 03:14:30,426 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 84.78% of their original sizes. [2018-12-03 03:14:30,426 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 03:14:31,296 INFO L418 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-12-03 03:14:31,296 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 03:14:31,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:14:31,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [6] total 61 [2018-12-03 03:14:31,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:31,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 03:14:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 03:14:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2909, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 03:14:31,298 INFO L87 Difference]: Start difference. First operand 269 states and 320 transitions. Second operand 57 states. [2018-12-03 03:14:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:46,208 INFO L93 Difference]: Finished difference Result 576 states and 743 transitions. [2018-12-03 03:14:46,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 03:14:46,208 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 163 [2018-12-03 03:14:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:46,209 INFO L225 Difference]: With dead ends: 576 [2018-12-03 03:14:46,209 INFO L226 Difference]: Without dead ends: 401 [2018-12-03 03:14:46,211 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1111, Invalid=11099, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 03:14:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-12-03 03:14:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 281. [2018-12-03 03:14:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-03 03:14:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 325 transitions. [2018-12-03 03:14:46,237 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 325 transitions. Word has length 163 [2018-12-03 03:14:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:46,238 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 325 transitions. [2018-12-03 03:14:46,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 03:14:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 325 transitions. [2018-12-03 03:14:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 03:14:46,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:46,239 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, 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] [2018-12-03 03:14:46,239 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:46,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1794911829, now seen corresponding path program 1 times [2018-12-03 03:14:46,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:46,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:46,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:46,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:46,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 03:14:46,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:14:46,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:14:46,293 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-12-03 03:14:46,293 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [339], [341], [348], [352], [356], [358], [362], [364], [371], [373], [398], [402], [448], [449], [455], [461], [463], [465], [472], [474], [475], [476], [478], [481], [537], [542], [545], [548], [550], [556], [559], [567], [570], [572], [577], [580], [584], [592], [595], [598], [600], [611], [612], [613], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [747], [748], [749], [750], [769], [770], [773], [774], [775], [776], [777], [778], [779], [793], [794], [797], [798], [801], [802], [805], [811], [812], [813] [2018-12-03 03:14:46,295 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:14:46,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:14:46,493 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:14:46,493 INFO L272 AbstractInterpreter]: Visited 108 different actions 336 times. Merged at 24 different actions 56 times. Never widened. Performed 6518 root evaluator evaluations with a maximum evaluation depth of 9. Performed 6518 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 5 fixpoints after 1 different actions. Largest state had 98 variables. [2018-12-03 03:14:46,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:46,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:14:46,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:14:46,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/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-12-03 03:14:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:46,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:14:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:46,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:14:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 03:14:46,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:14:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 03:14:46,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 03:14:46,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2018-12-03 03:14:46,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:46,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:46,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-03 03:14:46,835 INFO L87 Difference]: Start difference. First operand 281 states and 325 transitions. Second operand 6 states. [2018-12-03 03:14:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:46,925 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2018-12-03 03:14:46,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:46,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-12-03 03:14:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:46,926 INFO L225 Difference]: With dead ends: 448 [2018-12-03 03:14:46,926 INFO L226 Difference]: Without dead ends: 296 [2018-12-03 03:14:46,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:14:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-03 03:14:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2018-12-03 03:14:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-03 03:14:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 338 transitions. [2018-12-03 03:14:46,952 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 338 transitions. Word has length 163 [2018-12-03 03:14:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:46,952 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 338 transitions. [2018-12-03 03:14:46,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 338 transitions. [2018-12-03 03:14:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 03:14:46,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:46,953 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, 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] [2018-12-03 03:14:46,954 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:46,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash -974469450, now seen corresponding path program 1 times [2018-12-03 03:14:46,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:46,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:46,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 03:14:47,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:47,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:47,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:47,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:47,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:47,001 INFO L87 Difference]: Start difference. First operand 291 states and 338 transitions. Second operand 6 states. [2018-12-03 03:14:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:47,050 INFO L93 Difference]: Finished difference Result 453 states and 534 transitions. [2018-12-03 03:14:47,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:47,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-12-03 03:14:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:47,051 INFO L225 Difference]: With dead ends: 453 [2018-12-03 03:14:47,052 INFO L226 Difference]: Without dead ends: 319 [2018-12-03 03:14:47,052 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-12-03 03:14:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-03 03:14:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 284. [2018-12-03 03:14:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-12-03 03:14:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2018-12-03 03:14:47,075 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 164 [2018-12-03 03:14:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:47,076 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2018-12-03 03:14:47,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2018-12-03 03:14:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 03:14:47,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:47,077 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, 4, 4, 3, 3, 3, 3, 3, 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] [2018-12-03 03:14:47,077 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:47,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1046099915, now seen corresponding path program 1 times [2018-12-03 03:14:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:47,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:47,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:47,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:47,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-12-03 03:14:47,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:47,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:47,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:47,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:47,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:47,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:47,131 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 6 states. [2018-12-03 03:14:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:47,177 INFO L93 Difference]: Finished difference Result 344 states and 391 transitions. [2018-12-03 03:14:47,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:47,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-12-03 03:14:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:47,179 INFO L225 Difference]: With dead ends: 344 [2018-12-03 03:14:47,179 INFO L226 Difference]: Without dead ends: 271 [2018-12-03 03:14:47,179 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-12-03 03:14:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-03 03:14:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2018-12-03 03:14:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 03:14:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2018-12-03 03:14:47,207 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 204 [2018-12-03 03:14:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:47,208 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2018-12-03 03:14:47,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2018-12-03 03:14:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 03:14:47,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:14:47,209 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, 4, 4, 3, 3, 3, 3, 3, 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] [2018-12-03 03:14:47,209 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:14:47,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:14:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1129206307, now seen corresponding path program 1 times [2018-12-03 03:14:47,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:14:47,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:47,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:14:47,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:14:47,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:14:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:14:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-12-03 03:14:47,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:14:47,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:14:47,268 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:14:47,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:14:47,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:14:47,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:14:47,269 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand 6 states. [2018-12-03 03:14:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:14:47,307 INFO L93 Difference]: Finished difference Result 255 states and 288 transitions. [2018-12-03 03:14:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:14:47,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-12-03 03:14:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:14:47,307 INFO L225 Difference]: With dead ends: 255 [2018-12-03 03:14:47,308 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 03:14:47,309 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-12-03 03:14:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 03:14:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 03:14:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 03:14:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 03:14:47,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-12-03 03:14:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:14:47,309 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 03:14:47,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:14:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 03:14:47,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 03:14:47,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 03:14:47,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:47,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:14:48,542 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 84 [2018-12-03 03:14:48,896 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2018-12-03 03:14:49,049 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2018-12-03 03:14:49,214 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 68 [2018-12-03 03:14:49,383 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-12-03 03:14:49,778 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 66 [2018-12-03 03:14:49,946 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 66 [2018-12-03 03:14:50,223 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2018-12-03 03:14:50,368 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2018-12-03 03:14:50,628 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2018-12-03 03:14:50,869 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 87 [2018-12-03 03:14:51,125 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 66 [2018-12-03 03:14:51,380 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2018-12-03 03:14:51,967 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 75 [2018-12-03 03:14:52,137 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 47 [2018-12-03 03:14:53,125 WARN L180 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2018-12-03 03:14:53,350 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2018-12-03 03:14:53,487 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 59 [2018-12-03 03:14:53,721 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-12-03 03:14:54,021 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2018-12-03 03:14:54,342 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-12-03 03:14:54,570 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 66 [2018-12-03 03:14:54,798 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 86 [2018-12-03 03:14:54,970 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2018-12-03 03:14:55,289 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 69 [2018-12-03 03:14:55,541 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 69 [2018-12-03 03:14:56,357 WARN L180 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2018-12-03 03:14:56,472 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2018-12-03 03:14:56,771 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-12-03 03:14:57,308 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 88 [2018-12-03 03:14:57,701 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-12-03 03:14:57,903 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-12-03 03:14:58,322 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 89 [2018-12-03 03:14:58,764 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2018-12-03 03:14:58,979 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2018-12-03 03:14:59,265 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2018-12-03 03:14:59,621 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 88 [2018-12-03 03:14:59,686 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-12-03 03:14:59,686 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 59 80) the Hoare annotation is: (or (= 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 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,686 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-12-03 03:14:59,686 INFO L451 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-12-03 03:14:59,686 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-12-03 03:14:59,686 INFO L444 ceAbstractionStarter]: At program point L820(line 820) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,687 INFO L444 ceAbstractionStarter]: At program point L787(lines 780 828) the Hoare annotation is: (let ((.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:14:59,687 INFO L448 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-12-03 03:14:59,687 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-12-03 03:14:59,687 INFO L444 ceAbstractionStarter]: At program point L779(lines 772 829) the Hoare annotation is: (let ((.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:14:59,687 INFO L444 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (not (= ~myStatus~0 259)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,687 INFO L448 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-12-03 03:14:59,687 INFO L448 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-12-03 03:14:59,687 INFO L448 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-12-03 03:14:59,687 INFO L448 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L444 ceAbstractionStarter]: At program point L722(lines 721 762) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~pended~0 1))) (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L444 ceAbstractionStarter]: At program point L814(line 814) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-12-03 03:14:59,688 INFO L448 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-12-03 03:14:59,689 INFO L448 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-12-03 03:14:59,689 INFO L444 ceAbstractionStarter]: At program point L707(lines 706 765) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,689 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 646 832) the Hoare annotation is: (or (= 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 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,689 INFO L448 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-12-03 03:14:59,689 INFO L448 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-12-03 03:14:59,689 INFO L444 ceAbstractionStarter]: At program point L807(line 807) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,689 INFO L448 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-12-03 03:14:59,689 INFO L448 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-12-03 03:14:59,689 INFO L448 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-12-03 03:14:59,690 INFO L444 ceAbstractionStarter]: At program point L692-2(lines 692 695) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~MPR1~0 5) (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= ~MPR3~0 6) (= ~NP~0 1) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,690 INFO L444 ceAbstractionStarter]: At program point L717(lines 716 763) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~MPR1~0 5) (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= ~MPR3~0 6) (= ~NP~0 1) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,690 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-12-03 03:14:59,690 INFO L444 ceAbstractionStarter]: At program point L759(lines 682 771) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse0 (= ~DC~0 ~s~0)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:14:59,690 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-12-03 03:14:59,690 INFO L448 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-12-03 03:14:59,690 INFO L444 ceAbstractionStarter]: At program point L768(line 768) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse0 (= ~DC~0 ~s~0)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-12-03 03:14:59,691 INFO L444 ceAbstractionStarter]: At program point L727(lines 726 761) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~pended~0 1))) (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,691 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-12-03 03:14:59,691 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-12-03 03:14:59,691 INFO L444 ceAbstractionStarter]: At program point L794(line 794) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,691 INFO L448 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-12-03 03:14:59,691 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-12-03 03:14:59,691 INFO L444 ceAbstractionStarter]: At program point L712(lines 711 764) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~pended~0 1))) (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,692 INFO L444 ceAbstractionStarter]: At program point L803(lines 790 825) the Hoare annotation is: (let ((.cse2 (= ~DC~0 ~s~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (not (= ~pended~0 1)))) (let ((.cse7 (= 0 main_~status~6)) (.cse0 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse4 .cse5 .cse6 (= main_~status~6 ~lowerDriverReturn~0) (<= ~compRegistered~0 0)))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and (and (<= 1 ~NP~0) .cse0 (<= ~NP~0 1) .cse1 (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (<= ~IPC~0 ~s~0) .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse2 .cse6) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse1 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-12-03 03:14:59,692 INFO L451 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-12-03 03:14:59,692 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-12-03 03:14:59,692 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-12-03 03:14:59,692 INFO L448 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-12-03 03:14:59,692 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (and (<= 1 ~s~0) (<= ~s~0 1)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (= ~myStatus~0 259) (< ~setEventCalled~0 1) (not (= ~compRegistered~0 1)) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= 5 ~MPR1~0)) (< 1 ~setEventCalled~0)) [2018-12-03 03:14:59,692 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-12-03 03:14:59,692 INFO L444 ceAbstractionStarter]: At program point L866(line 866) the Hoare annotation is: (or (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (= ~myStatus~0 259) (< ~setEventCalled~0 1) (not (= ~compRegistered~0 1)) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= 5 ~MPR1~0)) (< 1 ~setEventCalled~0)) [2018-12-03 03:14:59,692 INFO L444 ceAbstractionStarter]: At program point L1055(lines 1054 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,692 INFO L448 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-12-03 03:14:59,693 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-12-03 03:14:59,693 INFO L444 ceAbstractionStarter]: At program point L1027(line 1027) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,693 INFO L448 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-12-03 03:14:59,693 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-12-03 03:14:59,693 INFO L448 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-12-03 03:14:59,693 INFO L444 ceAbstractionStarter]: At program point L1048(lines 1047 1070) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,693 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 1015 1099) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,693 INFO L444 ceAbstractionStarter]: At program point L1040(line 1040) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,693 INFO L444 ceAbstractionStarter]: At program point L1032(line 1032) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,693 INFO L448 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L444 ceAbstractionStarter]: At program point L1053(lines 1052 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L444 ceAbstractionStarter]: At program point L1067(lines 1023 1098) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-12-03 03:14:59,694 INFO L448 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-12-03 03:14:59,695 INFO L444 ceAbstractionStarter]: At program point L1092(line 1092) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,695 INFO L448 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-12-03 03:14:59,695 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-12-03 03:14:59,695 INFO L444 ceAbstractionStarter]: At program point L224(line 224) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,695 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-12-03 03:14:59,695 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-12-03 03:14:59,695 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPowerENTRY(lines 211 235) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-12-03 03:14:59,695 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (or (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,695 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-12-03 03:14:59,695 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L444 ceAbstractionStarter]: At program point L993(line 993) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse8 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse10 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1) .cse10) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse8 (or .cse4 .cse0 .cse9)) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse10))) [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-12-03 03:14:59,696 INFO L444 ceAbstractionStarter]: At program point L986(lines 978 997) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse8 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse10 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1) .cse10) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse8 (or .cse4 .cse0 .cse9)) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse10))) [2018-12-03 03:14:59,696 INFO L448 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-12-03 03:14:59,697 INFO L444 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse23 (+ ~SKIP1~0 2))) (let ((.cse21 (+ ~DC~0 2)) (.cse19 (+ ~NP~0 4)) (.cse6 (= ~myStatus~0 259)) (.cse14 (+ ~DC~0 5)) (.cse15 (= ~s~0 ~NP~0)) (.cse16 (<= .cse23 ~MPR1~0)) (.cse17 (<= 1 ~compRegistered~0)) (.cse18 (<= 1 ~s~0)) (.cse20 (= ~routine~0 0)) (.cse22 (not (= ~pended~0 1)))) (let ((.cse11 (and (not .cse6) (<= .cse14 ~IPC~0) .cse15 .cse16 .cse17 .cse18 .cse20 (= |old(~customIrp~0)| ~customIrp~0) .cse22)) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~MPR1~0 .cse19)) (.cse1 (< ~SKIP2~0 .cse21)) (.cse13 (< 1 ~NP~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 .cse23)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse10 (< ~compRegistered~0 1)) (.cse2 (and .cse15 .cse16 .cse17 .cse18 (<= .cse19 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) .cse20 (<= .cse21 ~SKIP2~0) (<= ~s~0 1) .cse22 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse8 (< ~IPC~0 .cse14)) (.cse9 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 (not (= 6 ~MPR3~0)) .cse2 (not (= 1 ~NP~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) .cse8 .cse9) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse10 (or .cse3 .cse0 .cse8)) .cse11 .cse12 (not (= |old(~s~0)| ~MPR3~0)) .cse1 .cse13 .cse9) (or .cse11 .cse0 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 (and (= |old(~customIrp~0)| 1) .cse2 (= 0 ~customIrp~0)) .cse8 (< |old(~s~0)| 1) .cse9))))) [2018-12-03 03:14:59,697 INFO L444 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse23 (+ ~SKIP1~0 2))) (let ((.cse21 (+ ~DC~0 2)) (.cse19 (+ ~NP~0 4)) (.cse6 (= ~myStatus~0 259)) (.cse14 (+ ~DC~0 5)) (.cse15 (= ~s~0 ~NP~0)) (.cse16 (<= .cse23 ~MPR1~0)) (.cse17 (<= 1 ~compRegistered~0)) (.cse18 (<= 1 ~s~0)) (.cse20 (= ~routine~0 0)) (.cse22 (not (= ~pended~0 1)))) (let ((.cse11 (and (not .cse6) (<= .cse14 ~IPC~0) .cse15 .cse16 .cse17 .cse18 .cse20 (= |old(~customIrp~0)| ~customIrp~0) .cse22)) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~MPR1~0 .cse19)) (.cse1 (< ~SKIP2~0 .cse21)) (.cse13 (< 1 ~NP~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 .cse23)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse10 (< ~compRegistered~0 1)) (.cse2 (and .cse15 .cse16 .cse17 .cse18 (<= .cse19 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) .cse20 (<= .cse21 ~SKIP2~0) (<= ~s~0 1) .cse22 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse8 (< ~IPC~0 .cse14)) (.cse9 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 (not (= 6 ~MPR3~0)) .cse2 (not (= 1 ~NP~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) .cse8 .cse9) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse10 (or .cse3 .cse0 .cse8)) .cse11 .cse12 (not (= |old(~s~0)| ~MPR3~0)) .cse1 .cse13 .cse9) (or .cse11 .cse0 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 (and (= |old(~customIrp~0)| 1) .cse2 (= 0 ~customIrp~0)) .cse8 (< |old(~s~0)| 1) .cse9))))) [2018-12-03 03:14:59,697 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 973 1014) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse11 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse8 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (<= 1 ~setEventCalled~0)) (.cse10 (<= ~setEventCalled~0 1)) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse13 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 (and (<= 1 ~s~0) (<= ~s~0 1) .cse8 .cse9 .cse10) .cse11 .cse12 (< |old(~s~0)| 1) .cse13) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse11 (or .cse4 .cse0 .cse12)) (and (= ~s~0 ~MPR3~0) .cse8 .cse9 .cse10) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse13))) [2018-12-03 03:14:59,697 INFO L444 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0))) (or (or (not (= 0 ~routine~0)) .cse0 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse1 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-12-03 03:14:59,697 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-12-03 03:14:59,698 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-12-03 03:14:59,698 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 (= ~s~0 ~NP~0) .cse1 (not (= ~compRegistered~0 0))) (or (or (not (= 0 ~routine~0)) .cse0 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse1 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (and (<= 1 ~s~0) (<= ~s~0 1)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-12-03 03:14:59,698 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-12-03 03:14:59,698 INFO L451 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2018-12-03 03:14:59,698 INFO L451 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2018-12-03 03:14:59,698 INFO L448 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-12-03 03:14:59,698 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-12-03 03:14:59,698 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-12-03 03:14:59,698 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-12-03 03:14:59,698 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)))) (not (= 0 ~routine~0)) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 ~s~0))) [2018-12-03 03:14:59,698 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-12-03 03:14:59,698 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-12-03 03:14:59,699 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-12-03 03:14:59,699 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-12-03 03:14:59,699 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-12-03 03:14:59,699 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,699 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-12-03 03:14:59,699 INFO L444 ceAbstractionStarter]: At program point DiskPerfSendToNextDriverENTRY(lines 186 210) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-12-03 03:14:59,699 INFO L444 ceAbstractionStarter]: At program point L206(line 206) the Hoare annotation is: (or (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,699 INFO L448 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-12-03 03:14:59,699 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-12-03 03:14:59,699 INFO L444 ceAbstractionStarter]: At program point L199(line 199) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-12-03 03:14:59,700 INFO L444 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (<= 1 ~setEventCalled~0)) (.cse2 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2) (and (<= 1 ~s~0) (<= ~s~0 1) .cse0 .cse1 .cse2) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)))) [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-12-03 03:14:59,700 INFO L444 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-12-03 03:14:59,700 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-12-03 03:14:59,701 INFO L444 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,701 INFO L448 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-12-03 03:14:59,701 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-12-03 03:14:59,701 INFO L448 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-12-03 03:14:59,701 INFO L444 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,701 INFO L444 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= ~s~0 1)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,701 INFO L448 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-12-03 03:14:59,701 INFO L444 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,702 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-12-03 03:14:59,702 INFO L444 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (and (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,702 INFO L448 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-12-03 03:14:59,702 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-12-03 03:14:59,702 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-12-03 03:14:59,702 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-12-03 03:14:59,702 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (= 259 DiskPerfRegisterDevice_~__cil_tmp32~0) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (let ((.cse0 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344))) (or (and .cse0 (= ~s~0 1)) (and (= ~s~0 6) .cse0))) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,702 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-12-03 03:14:59,702 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-12-03 03:14:59,703 INFO L444 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,703 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-12-03 03:14:59,703 INFO L444 ceAbstractionStarter]: At program point L520(line 520) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (let ((.cse1 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344)) (.cse2 (let ((.cse7 (= ~NP~0 1)) (.cse8 (= ~MPR1~0 5)) (.cse9 (not (= DiskPerfRegisterDevice_~irp~0 0))) (.cse10 (= ~routine~0 0)) (.cse11 (= ~MPR3~0 6))) (or (and .cse0 .cse7 .cse8 .cse9 (= ~s~0 6) .cse10 .cse11) (and .cse0 .cse7 .cse8 .cse9 .cse10 (= ~s~0 1) .cse11)))) (.cse3 (= 259 DiskPerfRegisterDevice_~__cil_tmp23~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= 1 ~setEventCalled~0)) (.cse6 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not .cse0) (not (= 5 ~MPR1~0)) (and .cse1 .cse2 .cse3 (<= ~s~0 1) .cse4 .cse5 .cse6) (not (= 6 ~MPR3~0)) (and .cse1 (<= 0 DiskPerfRegisterDevice_~status~5) .cse2 .cse3 .cse4 (= (mod DiskPerfRegisterDevice_~status~5 259) 0) .cse5 .cse6) (not (= 1 |old(~s~0)|))))) [2018-12-03 03:14:59,703 INFO L448 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-12-03 03:14:59,703 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-12-03 03:14:59,703 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-12-03 03:14:59,703 INFO L444 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= ~s~0 1)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1))) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,703 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-12-03 03:14:59,703 INFO L448 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-12-03 03:14:59,703 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-12-03 03:14:59,704 INFO L448 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-12-03 03:14:59,704 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-12-03 03:14:59,704 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-12-03 03:14:59,704 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-12-03 03:14:59,704 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-12-03 03:14:59,704 INFO L444 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,704 INFO L448 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-12-03 03:14:59,704 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-12-03 03:14:59,704 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (let ((.cse1 (= 259 DiskPerfRegisterDevice_~__cil_tmp27~0)) (.cse2 (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280)) (.cse3 (let ((.cse9 (= ~NP~0 1)) (.cse10 (= ~MPR1~0 5)) (.cse11 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344)) (.cse12 (= ~routine~0 0))) (or (and .cse0 .cse9 .cse10 .cse11 .cse12 (= ~s~0 1)) (and .cse0 .cse9 .cse10 (= ~s~0 6) .cse11 .cse12)))) (.cse4 (not (= DiskPerfRegisterDevice_~irp~0 0))) (.cse5 (not (= DiskPerfRegisterDevice_~output~0 0))) (.cse6 (not (= ~pended~0 1))) (.cse7 (<= 1 ~setEventCalled~0)) (.cse8 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not .cse0) (and .cse1 (and .cse2 (= (mod DiskPerfRegisterDevice_~status~5 259) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (not (= 5 ~MPR1~0)) (and .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= ~s~0 1) .cse6 .cse7 .cse8)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))))) [2018-12-03 03:14:59,705 INFO L444 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (not (= DiskPerfRegisterDevice_~irp~0 0)) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-03 03:14:59,705 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-12-03 03:14:59,705 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-12-03 03:14:59,705 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-12-03 03:14:59,705 INFO L444 ceAbstractionStarter]: At program point L263(line 263) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-03 03:14:59,705 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-12-03 03:14:59,705 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-12-03 03:14:59,705 INFO L444 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse2 (= 1 |old(~pended~0)|)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (= ~myStatus~0 259)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~DC~0 5)))) (and (let ((.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (= ~compRegistered~0 1))) (or (and .cse0 (= ~s~0 1) .cse1) .cse2 .cse3 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 5 ~MPR1~0)) (and .cse0 (and .cse1 (= (mod DiskPerfForwardIrpSynchronous_~status~3 259) 0))) .cse9 (not (= |old(~customIrp~0)| 0)))) (let ((.cse10 (<= 1 ~compRegistered~0)) (.cse11 (= ~routine~0 0)) (.cse12 (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259)) (.cse13 (< 258 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (.cse14 (not (= ~pended~0 1))) (.cse15 (<= 1 ~setEventCalled~0)) (.cse16 (<= ~setEventCalled~0 1))) (or (and .cse10 .cse11 (= ~s~0 ~MPR3~0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse10 (not (= 259 DiskPerfForwardIrpSynchronous_~status~3)) (<= 1 ~s~0) .cse11 .cse12 (<= ~s~0 1) .cse13 .cse14 .cse15 .cse16) .cse2 (< ~MPR1~0 (+ ~NP~0 4)) .cse3 (< 1 ~NP~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1))))) [2018-12-03 03:14:59,705 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-12-03 03:14:59,706 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-12-03 03:14:59,706 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-12-03 03:14:59,706 INFO L444 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (= ~myStatus~0 259)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 (< ~MPR1~0 (+ ~NP~0 4)) .cse1 (< 1 ~NP~0) (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~s~0)| 1)) (or .cse0 (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0)) .cse1 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 5 ~MPR1~0)) .cse7 (not (= |old(~customIrp~0)| 0))))) [2018-12-03 03:14:59,706 INFO L444 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (= ~myStatus~0 259)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) .cse1 (< 1 ~NP~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~s~0)| 1)) (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 .cse1 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 5 ~MPR1~0)) .cse7 (not (= |old(~customIrp~0)| 0))))) [2018-12-03 03:14:59,706 INFO L448 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-12-03 03:14:59,706 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-12-03 03:14:59,706 INFO L444 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-03 03:14:59,706 INFO L444 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (or (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (not (= 259 DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,706 INFO L448 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-12-03 03:14:59,707 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-12-03 03:14:59,707 INFO L444 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~compRegistered~0 1) (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (not (= ~pended~0 1)))) (or (and .cse0 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (not (= 259 DiskPerfStartDevice_~status~1)) .cse2 .cse3 .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,707 INFO L444 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,707 INFO L444 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~compRegistered~0 1) (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (not (= ~pended~0 1)))) (or (and .cse0 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (not (= 259 DiskPerfStartDevice_~status~1)) .cse2 .cse3 .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,707 INFO L444 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,707 INFO L448 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-12-03 03:14:59,707 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-12-03 03:14:59,707 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-12-03 03:14:59,708 INFO L444 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,708 INFO L444 ceAbstractionStarter]: At program point L403-2(lines 403 410) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,708 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-12-03 03:14:59,708 INFO L444 ceAbstractionStarter]: At program point L428(line 428) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,708 INFO L448 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-12-03 03:14:59,708 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-12-03 03:14:59,708 INFO L448 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-12-03 03:14:59,708 INFO L444 ceAbstractionStarter]: At program point DiskPerfDeviceControlENTRY(lines 353 434) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,708 INFO L448 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-12-03 03:14:59,708 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-12-03 03:14:59,708 INFO L444 ceAbstractionStarter]: At program point L396(line 396) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,708 INFO L448 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-12-03 03:14:59,709 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-12-03 03:14:59,709 INFO L444 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (not (= ~pended~0 1)))) (or (and .cse0 (= 0 DiskPerfDeviceControl_~status~4) .cse1) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and .cse0 (<= (+ DiskPerfDeviceControl_~status~4 1073741789) 0) .cse1))) [2018-12-03 03:14:59,709 INFO L448 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-12-03 03:14:59,709 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-12-03 03:14:59,709 INFO L444 ceAbstractionStarter]: At program point DiskPerfCreateENTRY(lines 288 298) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-12-03 03:14:59,709 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-12-03 03:14:59,709 INFO L444 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-12-03 03:14:59,709 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-12-03 03:14:59,709 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-12-03 03:14:59,709 INFO L448 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-12-03 03:14:59,709 INFO L444 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 166 185) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-03 03:14:59,710 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-12-03 03:14:59,710 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-12-03 03:14:59,710 INFO L444 ceAbstractionStarter]: At program point L181(line 181) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and .cse0 (not (= 259 DiskPerfRemoveDevice_~status~2)) .cse1 .cse2 .cse3 .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~2) (= |old(~myStatus~0)| ~myStatus~0) .cse0 .cse1 .cse2 .cse3 .cse4) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1))) [2018-12-03 03:14:59,710 INFO L448 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-12-03 03:14:59,710 INFO L444 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-03 03:14:59,710 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-12-03 03:14:59,710 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-12-03 03:14:59,710 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-12-03 03:14:59,710 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-12-03 03:14:59,710 INFO L451 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-12-03 03:14:59,710 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-12-03 03:14:59,711 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-12-03 03:14:59,711 INFO L444 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse21 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse14 (not (= 0 ~routine~0))) (.cse20 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (= 1 |old(~pended~0)|)) (.cse18 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse19 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse14 .cse20 .cse15 .cse16 (< ~compRegistered~0 1) .cse18 .cse19)) (.cse3 (not (= 5 ~MPR1~0))) (.cse5 (<= (+ .cse21 1) 0)) (.cse6 (<= 1 ~setEventCalled~0)) (.cse7 (= (+ IofCallDriver_~compRetStatus~0 1073741802) 0)) (.cse8 (= ~s~0 1)) (.cse9 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse10 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse11 (not (= ~pended~0 1))) (.cse12 (<= ~setEventCalled~0 1)) (.cse4 (not (= 6 ~MPR3~0))) (.cse13 (not (= 1 |old(~s~0)|))) (.cse17 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= ~customIrp~0 0)) .cse13) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 (and (not (= IofCallDriver_~Irp 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse4 .cse13) (or .cse14 .cse15 .cse16 .cse17 (not (= ~SKIP1~0 |old(~s~0)|)) .cse18 .cse19) (or .cse14 .cse20 .cse16 .cse17 .cse18 .cse19)))) [2018-12-03 03:14:59,711 INFO L444 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse22 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse21 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (= 1 |old(~pended~0)|)) (.cse19 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse10 (not (= ~compRegistered~0 1))) (.cse11 (or .cse15 .cse16 .cse21 .cse17 (< ~compRegistered~0 1) .cse19 .cse20)) (.cse12 (not (= 5 ~MPR1~0))) (.cse1 (<= .cse23 0)) (.cse2 (<= 0 .cse23)) (.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse3 (<= (+ .cse22 1) 0)) (.cse4 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse13 (not (= 6 ~MPR3~0))) (.cse14 (not (= 1 |old(~s~0)|))) (.cse8 (not (= ~pended~0 1))) (.cse18 (not (= ~compRegistered~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0)) .cse14) (or (and (= ~s~0 ~NP~0) .cse8) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse10 .cse11 .cse12 (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse3 .cse8 .cse4 .cse9) .cse13 .cse14) (or .cse15 .cse21 .cse17 (and (= ~s~0 ~SKIP1~0) .cse8) .cse18 (not (= ~SKIP1~0 |old(~s~0)|)) .cse19 .cse20)))) [2018-12-03 03:14:59,711 INFO L444 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse6 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (= 1 |old(~pended~0)|)) (.cse10 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse6 .cse12 .cse7 .cse8 (< ~compRegistered~0 1) .cse10 .cse11)) (.cse3 (not (= 5 ~MPR1~0))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse9 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~customIrp~0 0)) .cse5) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 (not (= ~SKIP1~0 |old(~s~0)|)) .cse10 .cse11) (or .cse6 .cse12 .cse8 .cse9 .cse10 .cse11)))) [2018-12-03 03:14:59,711 INFO L448 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-12-03 03:14:59,712 INFO L444 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse9 (not (= 0 ~routine~0))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (= 1 |old(~pended~0)|)) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse12 (not (= ~compRegistered~0 0))) (.cse3 (= ~myStatus~0 259)) (.cse0 (<= 1 ~s~0)) (.cse1 (<= ~s~0 1)) (.cse2 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 1))) (.cse5 (or .cse9 .cse15 .cse10 .cse11 (< ~compRegistered~0 1) .cse13 .cse14)) (.cse6 (not (= 5 ~MPR1~0))) (.cse7 (not (= 6 ~MPR3~0))) (.cse8 (not (= 1 |old(~s~0)|)))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~customIrp~0 0)) .cse8) (or .cse9 .cse10 .cse11 .cse12 (not (= ~SKIP1~0 |old(~s~0)|)) .cse13 .cse14) (or .cse9 .cse15 .cse11 .cse12 .cse13 .cse14) (or (= |IofCallDriver_#in~Irp| 0) .cse3 (and (not (= IofCallDriver_~Irp 0)) .cse0 .cse1 .cse2) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2018-12-03 03:14:59,712 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse8 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 |old(~pended~0)|)) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (not (= ~pended~0 1)))) (let ((.cse0 (and (<= 1 ~s~0) (<= ~s~0 1) .cse7)) (.cse1 (= ~myStatus~0 259)) (.cse2 (not (= ~compRegistered~0 1))) (.cse3 (or .cse8 .cse9 .cse14 .cse10 (< ~compRegistered~0 1) .cse12 .cse13)) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (not (= 6 ~MPR3~0))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse11 (not (= ~compRegistered~0 0)))) (and (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (and (= ~s~0 ~NP~0) .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~customIrp~0 0)) .cse6) (or .cse8 .cse14 .cse10 (and (= ~s~0 ~SKIP1~0) .cse7) .cse11 (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 .cse13)))) [2018-12-03 03:14:59,712 INFO L448 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-12-03 03:14:59,712 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-12-03 03:14:59,712 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-12-03 03:14:59,712 INFO L448 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-12-03 03:14:59,712 INFO L444 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (not (= 0 ~routine~0))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse10 (or .cse1 .cse2 .cse13 .cse3 (< ~compRegistered~0 1) .cse5 .cse6)) (.cse12 (not (= 6 ~MPR3~0))) (.cse7 (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse14 0) (<= 0 .cse14) (<= (+ .cse15 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) .cse0 (<= ~setEventCalled~0 1)))) (.cse8 (= ~myStatus~0 259)) (.cse9 (not (= ~compRegistered~0 1))) (.cse11 (not (= 5 ~MPR1~0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0)) (not (= 1 |old(~s~0)|))) (or .cse1 .cse13 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6) (or (= |IofCallDriver_#in~Irp| 0) .cse10 .cse12 (not (= 1 ~NP~0)) .cse7 .cse8 .cse9 .cse11)))) [2018-12-03 03:14:59,714 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-12-03 03:14:59,714 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-12-03 03:14:59,714 INFO L448 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-12-03 03:14:59,714 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-12-03 03:14:59,714 INFO L444 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse8 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 |old(~pended~0)|)) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (not (= ~pended~0 1)))) (let ((.cse11 (not (= ~compRegistered~0 0))) (.cse1 (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse15 0) (<= 0 .cse15) (<= (+ .cse16 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) .cse7 (<= ~setEventCalled~0 1)))) (.cse0 (= ~myStatus~0 259)) (.cse2 (not (= ~compRegistered~0 1))) (.cse3 (or .cse8 .cse9 .cse14 .cse10 (< ~compRegistered~0 1) .cse12 .cse13)) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (not (= 6 ~MPR3~0))) (.cse6 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~customIrp~0 0)) .cse6) (or (and (= ~s~0 ~NP~0) .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse8 .cse14 .cse10 (and (= ~s~0 ~SKIP1~0) .cse7) .cse11 (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 .cse13) (or (= |IofCallDriver_#in~Irp| 0) .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2018-12-03 03:14:59,714 INFO L448 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-12-03 03:14:59,714 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-12-03 03:14:59,715 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-12-03 03:14:59,715 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-12-03 03:14:59,715 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-12-03 03:14:59,715 INFO L448 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-12-03 03:14:59,715 INFO L444 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse6 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (= 1 |old(~pended~0)|)) (.cse10 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse6 .cse12 .cse7 .cse8 (< ~compRegistered~0 1) .cse10 .cse11)) (.cse3 (not (= 5 ~MPR1~0))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse9 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~customIrp~0 0)) .cse5) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 (not (= ~SKIP1~0 |old(~s~0)|)) .cse10 .cse11) (or .cse6 .cse12 .cse8 .cse9 .cse10 .cse11)))) [2018-12-03 03:14:59,721 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-12-03 03:14:59,721 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-12-03 03:14:59,721 INFO L444 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse22 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse21 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (= 1 |old(~pended~0)|)) (.cse19 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse10 (not (= ~compRegistered~0 1))) (.cse11 (or .cse15 .cse16 .cse21 .cse17 (< ~compRegistered~0 1) .cse19 .cse20)) (.cse12 (not (= 5 ~MPR1~0))) (.cse1 (<= .cse23 0)) (.cse2 (<= 0 .cse23)) (.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse3 (<= (+ .cse22 1) 0)) (.cse4 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse13 (not (= 6 ~MPR3~0))) (.cse14 (not (= 1 |old(~s~0)|))) (.cse8 (not (= ~pended~0 1))) (.cse18 (not (= ~compRegistered~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0)) .cse14) (or (and (= ~s~0 ~NP~0) .cse8) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse10 .cse11 .cse12 (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse3 .cse8 .cse4 .cse9) .cse13 .cse14) (or .cse15 .cse21 .cse17 (and (= ~s~0 ~SKIP1~0) .cse8) .cse18 (not (= ~SKIP1~0 |old(~s~0)|)) .cse19 .cse20)))) [2018-12-03 03:14:59,722 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-12-03 03:14:59,722 INFO L451 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2018-12-03 03:14:59,722 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-12-03 03:14:59,722 INFO L451 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-12-03 03:14:59,722 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-12-03 03:14:59,722 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-12-03 03:14:59,722 INFO L448 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-12-03 03:14:59,722 INFO L451 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-12-03 03:14:59,722 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-12-03 03:14:59,722 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-12-03 03:14:59,722 INFO L448 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L451 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L444 ceAbstractionStarter]: At program point L128(lines 111 129) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= ~DC~0 ~s~0) (not (= 259 DiskPerfDispatchPnp_~status~0)) (= ~routine~0 0) (<= 1 ~compRegistered~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-03 03:14:59,729 INFO L444 ceAbstractionStarter]: At program point L110(lines 109 130) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (and (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,729 INFO L444 ceAbstractionStarter]: At program point L108(lines 107 130) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,729 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-12-03 03:14:59,730 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,732 INFO L444 ceAbstractionStarter]: At program point L105(lines 104 131) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:14:59,732 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) (= |old(~customIrp~0)| ~customIrp~0)) [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:14:59,732 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~myStatus~0 259)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (not (= ~pended~0 1))) [2018-12-03 03:14:59,732 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:14:59,732 INFO L444 ceAbstractionStarter]: At program point L448(line 448) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-12-03 03:14:59,732 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-12-03 03:14:59,733 INFO L444 ceAbstractionStarter]: At program point DiskPerfShutdownFlushENTRY(lines 435 452) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-03 03:14:59,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:14:59 BoogieIcfgContainer [2018-12-03 03:14:59,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 03:14:59,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 03:14:59,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 03:14:59,761 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 03:14:59,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:14:20" (3/4) ... [2018-12-03 03:14:59,764 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-03 03:14:59,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-12-03 03:14:59,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 03:14:59,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-12-03 03:14:59,783 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2018-12-03 03:14:59,784 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-12-03 03:14:59,785 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 03:14:59,786 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 03:14:59,809 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == \old(pended) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,809 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == \old(pended) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,810 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 <= NP && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0))) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(259 == status)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (IPC <= s && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (0 == status && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,810 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled))) && ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-12-03 03:14:59,811 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled))) && ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-12-03 03:14:59,811 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-12-03 03:14:59,811 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(6 == MPR3)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-12-03 03:14:59,811 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((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(myStatus) == 259) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,811 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-12-03 03:14:59,811 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(6 == MPR3)) || !(1 == NP)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) [2018-12-03 03:14:59,811 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((DC == s && !(259 == status)) && routine == 0) && 1 <= compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,811 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 == \old(pended) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && !(259 == status))) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,812 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((myStatus == 259 || ((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(1 == NP)) || ((1 <= s && s <= 1) && !(pended == 1))) || !(0 == routine)) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s)) [2018-12-03 03:14:59,812 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == pended || ((((1 <= s && s <= 1) && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) [2018-12-03 03:14:59,812 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-12-03 03:14:59,812 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-12-03 03:14:59,812 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(6 == MPR3)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-12-03 03:14:59,812 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s))) [2018-12-03 03:14:59,812 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,813 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == \old(pended) || ((((((((((((MPR1 == 5 && !(myStatus == 259)) && DC + 5 <= IPC) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && MPR3 == 6) && NP == 1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,813 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,813 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,814 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,814 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && !(pended == 1)) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,814 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || !(\old(customIrp) == 0) [2018-12-03 03:14:59,815 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-12-03 03:14:59,815 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-12-03 03:14:59,865 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_02931fd3-ae2f-4acc-9938-8d9864f9b8c0/bin-2019/utaipan/witness.graphml [2018-12-03 03:14:59,865 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 03:14:59,866 INFO L168 Benchmark]: Toolchain (without parser) took 39989.17 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 969.9 MB). Free memory was 951.7 MB in the beginning and 1.3 GB in the end (delta: -309.3 MB). Peak memory consumption was 660.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:14:59,866 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:14:59,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-03 03:14:59,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:14:59,866 INFO L168 Benchmark]: Boogie Preprocessor took 30.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 03:14:59,866 INFO L168 Benchmark]: RCFGBuilder took 473.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. [2018-12-03 03:14:59,867 INFO L168 Benchmark]: TraceAbstraction took 39081.72 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 855.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -288.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-03 03:14:59,867 INFO L168 Benchmark]: Witness Printer took 104.75 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2018-12-03 03:14:59,868 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 473.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39081.72 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 855.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -288.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 104.75 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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: 1000]: Loop Invariant Derived loop invariant: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled))) && ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == \old(pended) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1052]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled))) && ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s))) - InvariantResult [Line: 845]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: (((((((((((((1 == pended || ((((1 <= s && s <= 1) && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= NP && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0))) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(259 == status)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (IPC <= s && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (0 == status && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(6 == MPR3)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 716]: Loop Invariant Derived loop invariant: ((((((((((((1 == \old(pended) || ((((((((((((MPR1 == 5 && !(myStatus == 259)) && DC + 5 <= IPC) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && MPR3 == 6) && NP == 1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 843]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == \old(pended) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && !(259 == status))) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == \old(pended) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: (((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(6 == MPR3)) || !(1 == NP)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || !(\old(customIrp) == 0) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && !(pended == 1)) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((DC == s && !(259 == status)) && routine == 0) && 1 <= compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((((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(myStatus) == 259) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(6 == MPR3)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: ((((((((myStatus == 259 || ((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(1 == NP)) || ((1 <= s && s <= 1) && !(pended == 1))) || !(0 == routine)) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s)) - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 307 locations, 1 error locations. SAFE Result, 39.0s OverallTime, 44 OverallIterations, 4 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 12.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 12964 SDtfs, 7778 SDslu, 36784 SDs, 0 SdLazy, 12092 SolverSat, 2048 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 900 GetRequests, 532 SyntacticMatches, 13 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9438488180591708 AbsIntWeakeningRatio, 2.1481481481481484 AbsIntAvgWeakeningVarsNumRemoved, 10.839506172839506 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 44 MinimizatonAttempts, 1272 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4386 PreInvPairs, 4627 NumberOfFragments, 9601 HoareAnnotationTreeSize, 4386 FomulaSimplifications, 66727 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 109 FomulaSimplificationsInter, 45437 FormulaSimplificationTreeSizeReductionInter, 11.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3392 NumberOfCodeBlocks, 3392 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3509 ConstructedInterpolants, 0 QuantifiedInterpolants, 519278 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 46 InterpolantComputations, 43 PerfectInterpolantSequences, 830/848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...