./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_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/config/AutomizerReach.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_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-08 09:23:42,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:23:42,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:23:42,810 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:23:42,810 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:23:42,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:23:42,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:23:42,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:23:42,813 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:23:42,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:23:42,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:23:42,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:23:42,814 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:23:42,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:23:42,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:23:42,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:23:42,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:23:42,817 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:23:42,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:23:42,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:23:42,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:23:42,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:23:42,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:23:42,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:23:42,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:23:42,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:23:42,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:23:42,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:23:42,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:23:42,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:23:42,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:23:42,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:23:42,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:23:42,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:23:42,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:23:42,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:23:42,825 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 09:23:42,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:23:42,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:23:42,832 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:23:42,832 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:23:42,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:23:42,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:23:42,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:23:42,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:23:42,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:23:42,834 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:23:42,835 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:23:42,835 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:23:42,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 09:23:42,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 564a601a6273fd55bda5923edf4b35a694c899ec [2018-12-08 09:23:42,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:23:42,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:23:42,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:23:42,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:23:42,863 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:23:42,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 09:23:42,903 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/data/8abe2f25a/60e673dc20a7427dbe89bf44f574cb1b/FLAG30ee08178 [2018-12-08 09:23:43,338 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:23:43,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 09:23:43,344 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/data/8abe2f25a/60e673dc20a7427dbe89bf44f574cb1b/FLAG30ee08178 [2018-12-08 09:23:43,352 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/data/8abe2f25a/60e673dc20a7427dbe89bf44f574cb1b [2018-12-08 09:23:43,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:23:43,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:23:43,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:23:43,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:23:43,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:23:43,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1d255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43, skipping insertion in model container [2018-12-08 09:23:43,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:23:43,387 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:23:43,529 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:23:43,533 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:23:43,629 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:23:43,642 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:23:43,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43 WrapperNode [2018-12-08 09:23:43,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:23:43,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:23:43,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:23:43,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:23:43,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:23:43,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:23:43,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:23:43,660 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:23:43,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... [2018-12-08 09:23:43,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:23:43,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:23:43,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:23:43,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:23:43,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-08 09:23:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-08 09:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 09:23:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 09:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-12-08 09:23:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-12-08 09:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-08 09:23:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-08 09:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-08 09:23:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-08 09:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-12-08 09:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-12-08 09:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-08 09:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-08 09:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-08 09:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-08 09:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-08 09:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-08 09:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-08 09:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-08 09:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-08 09:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-08 09:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-12-08 09:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-12-08 09:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-12-08 09:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-12-08 09:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-12-08 09:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-12-08 09:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-12-08 09:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-12-08 09:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-12-08 09:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-12-08 09:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-12-08 09:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-12-08 09:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-12-08 09:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-12-08 09:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-08 09:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-08 09:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-12-08 09:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-12-08 09:23:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-08 09:23:43,727 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-08 09:23:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-12-08 09:23:43,727 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-12-08 09:23:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-12-08 09:23:43,727 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-12-08 09:23:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-12-08 09:23:43,727 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-12-08 09:23:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 09:23:43,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 09:23:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:23:43,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:23:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-12-08 09:23:43,727 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-12-08 09:23:43,856 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 09:23:43,856 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 09:23:43,959 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 09:23:43,960 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 09:23:43,995 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 09:23:43,995 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 09:23:44,012 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 09:23:44,012 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 09:23:44,121 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 09:23:44,121 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 09:23:44,160 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 09:23:44,160 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 09:23:44,181 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:23:44,182 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 09:23:44,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:23:44 BoogieIcfgContainer [2018-12-08 09:23:44,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:23:44,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:23:44,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:23:44,185 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:23:44,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:23:43" (1/3) ... [2018-12-08 09:23:44,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af677d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:23:44, skipping insertion in model container [2018-12-08 09:23:44,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:43" (2/3) ... [2018-12-08 09:23:44,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af677d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:23:44, skipping insertion in model container [2018-12-08 09:23:44,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:23:44" (3/3) ... [2018-12-08 09:23:44,187 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 09:23:44,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:23:44,199 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 09:23:44,208 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 09:23:44,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:23:44,227 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:23:44,228 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:23:44,228 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:23:44,228 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:23:44,228 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:23:44,228 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:23:44,228 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:23:44,228 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:23:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2018-12-08 09:23:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 09:23:44,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:44,247 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-08 09:23:44,249 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:44,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2018-12-08 09:23:44,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:44,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:44,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:44,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:44,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:44,374 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-08 09:23:44,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:44,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:44,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:44,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:44,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:44,387 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2018-12-08 09:23:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:44,491 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2018-12-08 09:23:44,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:44,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 09:23:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:44,500 INFO L225 Difference]: With dead ends: 537 [2018-12-08 09:23:44,500 INFO L226 Difference]: Without dead ends: 287 [2018-12-08 09:23:44,504 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-08 09:23:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-08 09:23:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-12-08 09:23:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-12-08 09:23:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2018-12-08 09:23:44,544 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2018-12-08 09:23:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:44,544 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2018-12-08 09:23:44,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2018-12-08 09:23:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 09:23:44,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:44,545 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-08 09:23:44,546 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:44,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash -415593342, now seen corresponding path program 1 times [2018-12-08 09:23:44,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:44,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:44,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:44,618 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-08 09:23:44,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:44,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:44,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:44,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:44,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:44,620 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2018-12-08 09:23:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:44,735 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2018-12-08 09:23:44,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:44,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 09:23:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:44,741 INFO L225 Difference]: With dead ends: 637 [2018-12-08 09:23:44,741 INFO L226 Difference]: Without dead ends: 454 [2018-12-08 09:23:44,743 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-08 09:23:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-08 09:23:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2018-12-08 09:23:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-12-08 09:23:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2018-12-08 09:23:44,776 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2018-12-08 09:23:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:44,776 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2018-12-08 09:23:44,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2018-12-08 09:23:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 09:23:44,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:44,777 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-08 09:23:44,777 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:44,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1358856561, now seen corresponding path program 1 times [2018-12-08 09:23:44,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:44,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:44,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:44,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:44,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:44,837 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-08 09:23:44,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:44,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:44,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:44,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:44,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:44,839 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2018-12-08 09:23:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:44,879 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2018-12-08 09:23:44,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:44,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 09:23:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:44,883 INFO L225 Difference]: With dead ends: 963 [2018-12-08 09:23:44,883 INFO L226 Difference]: Without dead ends: 646 [2018-12-08 09:23:44,885 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-08 09:23:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-12-08 09:23:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2018-12-08 09:23:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-12-08 09:23:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2018-12-08 09:23:44,911 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2018-12-08 09:23:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:44,911 INFO L480 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2018-12-08 09:23:44,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2018-12-08 09:23:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 09:23:44,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:44,912 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-08 09:23:44,912 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:44,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:44,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2018-12-08 09:23:44,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:44,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:44,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:44,946 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-08 09:23:44,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:44,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:44,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:44,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:44,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:44,947 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2018-12-08 09:23:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:45,011 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2018-12-08 09:23:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:45,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 09:23:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:45,014 INFO L225 Difference]: With dead ends: 621 [2018-12-08 09:23:45,014 INFO L226 Difference]: Without dead ends: 617 [2018-12-08 09:23:45,015 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-08 09:23:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-08 09:23:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2018-12-08 09:23:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-08 09:23:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2018-12-08 09:23:45,034 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2018-12-08 09:23:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:45,034 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2018-12-08 09:23:45,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2018-12-08 09:23:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 09:23:45,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:45,036 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-08 09:23:45,036 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:45,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:45,036 INFO L82 PathProgramCache]: Analyzing trace with hash 185749717, now seen corresponding path program 1 times [2018-12-08 09:23:45,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:45,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:45,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:45,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:45,056 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-08 09:23:45,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:45,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:45,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:45,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:45,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:45,058 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2018-12-08 09:23:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:45,101 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2018-12-08 09:23:45,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:45,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-08 09:23:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:45,107 INFO L225 Difference]: With dead ends: 1072 [2018-12-08 09:23:45,108 INFO L226 Difference]: Without dead ends: 1053 [2018-12-08 09:23:45,108 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-08 09:23:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2018-12-08 09:23:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2018-12-08 09:23:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-12-08 09:23:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2018-12-08 09:23:45,160 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2018-12-08 09:23:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:45,160 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2018-12-08 09:23:45,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2018-12-08 09:23:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 09:23:45,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:45,162 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-08 09:23:45,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:45,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash 171404808, now seen corresponding path program 1 times [2018-12-08 09:23:45,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:45,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:45,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:45,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:45,194 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-08 09:23:45,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:45,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:45,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:45,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:45,195 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2018-12-08 09:23:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:45,278 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2018-12-08 09:23:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:45,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-08 09:23:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:45,284 INFO L225 Difference]: With dead ends: 1050 [2018-12-08 09:23:45,284 INFO L226 Difference]: Without dead ends: 1045 [2018-12-08 09:23:45,285 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-08 09:23:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-12-08 09:23:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2018-12-08 09:23:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-12-08 09:23:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2018-12-08 09:23:45,347 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2018-12-08 09:23:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:45,347 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2018-12-08 09:23:45,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2018-12-08 09:23:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 09:23:45,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:45,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:23:45,349 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:45,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1471308180, now seen corresponding path program 1 times [2018-12-08 09:23:45,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:45,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:45,397 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-08 09:23:45,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:45,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:23:45,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:23:45,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:23:45,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:23:45,398 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2018-12-08 09:23:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:45,447 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2018-12-08 09:23:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:23:45,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-08 09:23:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:45,452 INFO L225 Difference]: With dead ends: 1058 [2018-12-08 09:23:45,452 INFO L226 Difference]: Without dead ends: 1036 [2018-12-08 09:23:45,453 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-08 09:23:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-12-08 09:23:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2018-12-08 09:23:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-12-08 09:23:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2018-12-08 09:23:45,483 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2018-12-08 09:23:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:45,483 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2018-12-08 09:23:45,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:23:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2018-12-08 09:23:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 09:23:45,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:45,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] [2018-12-08 09:23:45,484 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:45,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1601291379, now seen corresponding path program 1 times [2018-12-08 09:23:45,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:45,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:45,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:45,509 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-08 09:23:45,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:45,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:45,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:45,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:45,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:45,510 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2018-12-08 09:23:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:45,532 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2018-12-08 09:23:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:45,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-08 09:23:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:45,534 INFO L225 Difference]: With dead ends: 1448 [2018-12-08 09:23:45,535 INFO L226 Difference]: Without dead ends: 578 [2018-12-08 09:23:45,537 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-08 09:23:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-12-08 09:23:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2018-12-08 09:23:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-08 09:23:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2018-12-08 09:23:45,553 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2018-12-08 09:23:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:45,553 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2018-12-08 09:23:45,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2018-12-08 09:23:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 09:23:45,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:45,554 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-08 09:23:45,554 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:45,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2018-12-08 09:23:45,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:45,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:45,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:45,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:45,589 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-08 09:23:45,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:45,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:23:45,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:23:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:23:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:23:45,590 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 5 states. [2018-12-08 09:23:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:45,815 INFO L93 Difference]: Finished difference Result 586 states and 829 transitions. [2018-12-08 09:23:45,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:23:45,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-08 09:23:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:45,818 INFO L225 Difference]: With dead ends: 586 [2018-12-08 09:23:45,819 INFO L226 Difference]: Without dead ends: 580 [2018-12-08 09:23:45,819 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-08 09:23:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-12-08 09:23:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-12-08 09:23:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-08 09:23:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2018-12-08 09:23:45,836 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2018-12-08 09:23:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:45,836 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2018-12-08 09:23:45,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:23:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2018-12-08 09:23:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 09:23:45,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:45,837 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-08 09:23:45,837 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:45,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2018-12-08 09:23:45,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:45,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:45,870 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-08 09:23:45,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:45,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:23:45,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:23:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:23:45,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:23:45,872 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 5 states. [2018-12-08 09:23:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:46,071 INFO L93 Difference]: Finished difference Result 586 states and 828 transitions. [2018-12-08 09:23:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:23:46,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-08 09:23:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:46,073 INFO L225 Difference]: With dead ends: 586 [2018-12-08 09:23:46,073 INFO L226 Difference]: Without dead ends: 580 [2018-12-08 09:23:46,073 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-08 09:23:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-12-08 09:23:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-12-08 09:23:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-08 09:23:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2018-12-08 09:23:46,090 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2018-12-08 09:23:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:46,090 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2018-12-08 09:23:46,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:23:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2018-12-08 09:23:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 09:23:46,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:46,091 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-08 09:23:46,091 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:46,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2018-12-08 09:23:46,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:46,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:46,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:46,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:46,123 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-08 09:23:46,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:46,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:46,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:46,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:46,124 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2018-12-08 09:23:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:46,176 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2018-12-08 09:23:46,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:23:46,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-08 09:23:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:46,179 INFO L225 Difference]: With dead ends: 601 [2018-12-08 09:23:46,179 INFO L226 Difference]: Without dead ends: 576 [2018-12-08 09:23:46,180 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-08 09:23:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-12-08 09:23:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2018-12-08 09:23:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-12-08 09:23:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2018-12-08 09:23:46,207 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2018-12-08 09:23:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:46,208 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2018-12-08 09:23:46,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2018-12-08 09:23:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 09:23:46,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:46,209 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-08 09:23:46,209 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:46,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:46,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1921382045, now seen corresponding path program 1 times [2018-12-08 09:23:46,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:46,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:46,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:46,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:46,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:46,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:46,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:46,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:46,242 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2018-12-08 09:23:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:46,345 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2018-12-08 09:23:46,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:46,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-08 09:23:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:46,349 INFO L225 Difference]: With dead ends: 810 [2018-12-08 09:23:46,349 INFO L226 Difference]: Without dead ends: 802 [2018-12-08 09:23:46,350 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-08 09:23:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-12-08 09:23:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2018-12-08 09:23:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-12-08 09:23:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2018-12-08 09:23:46,382 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2018-12-08 09:23:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:46,383 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2018-12-08 09:23:46,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2018-12-08 09:23:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 09:23:46,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:46,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:23:46,384 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:46,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:46,384 INFO L82 PathProgramCache]: Analyzing trace with hash 488507897, now seen corresponding path program 1 times [2018-12-08 09:23:46,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:46,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:46,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:46,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:46,420 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-08 09:23:46,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:46,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:23:46,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:23:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:23:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:23:46,421 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2018-12-08 09:23:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:46,565 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2018-12-08 09:23:46,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:23:46,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-08 09:23:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:46,568 INFO L225 Difference]: With dead ends: 719 [2018-12-08 09:23:46,568 INFO L226 Difference]: Without dead ends: 452 [2018-12-08 09:23:46,570 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-08 09:23:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-12-08 09:23:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2018-12-08 09:23:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-12-08 09:23:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2018-12-08 09:23:46,595 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2018-12-08 09:23:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:46,596 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2018-12-08 09:23:46,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:23:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2018-12-08 09:23:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 09:23:46,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:46,597 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-08 09:23:46,597 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:46,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1019702007, now seen corresponding path program 1 times [2018-12-08 09:23:46,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:46,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:46,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:46,660 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-08 09:23:46,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:46,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 09:23:46,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:23:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:23:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:23:46,661 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2018-12-08 09:23:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:46,764 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2018-12-08 09:23:46,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:23:46,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-12-08 09:23:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:46,765 INFO L225 Difference]: With dead ends: 447 [2018-12-08 09:23:46,765 INFO L226 Difference]: Without dead ends: 443 [2018-12-08 09:23:46,766 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-08 09:23:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-08 09:23:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-12-08 09:23:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-12-08 09:23:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2018-12-08 09:23:46,778 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2018-12-08 09:23:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:46,778 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2018-12-08 09:23:46,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:23:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2018-12-08 09:23:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 09:23:46,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:46,779 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-08 09:23:46,779 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:46,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1019425177, now seen corresponding path program 1 times [2018-12-08 09:23:46,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:46,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:46,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:46,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:46,824 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-08 09:23:46,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:46,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 09:23:46,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:23:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:23:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:23:46,825 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2018-12-08 09:23:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:46,883 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2018-12-08 09:23:46,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:23:46,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-12-08 09:23:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:46,884 INFO L225 Difference]: With dead ends: 760 [2018-12-08 09:23:46,885 INFO L226 Difference]: Without dead ends: 462 [2018-12-08 09:23:46,885 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-08 09:23:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-08 09:23:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2018-12-08 09:23:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-08 09:23:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2018-12-08 09:23:46,898 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2018-12-08 09:23:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:46,898 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2018-12-08 09:23:46,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:23:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2018-12-08 09:23:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 09:23:46,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:46,899 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-08 09:23:46,899 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:46,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash 56692718, now seen corresponding path program 1 times [2018-12-08 09:23:46,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:46,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:46,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:46,934 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-08 09:23:46,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:46,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:23:46,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:23:46,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:23:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:23:46,935 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2018-12-08 09:23:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:47,241 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2018-12-08 09:23:47,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:23:47,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-08 09:23:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:47,243 INFO L225 Difference]: With dead ends: 580 [2018-12-08 09:23:47,243 INFO L226 Difference]: Without dead ends: 561 [2018-12-08 09:23:47,243 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-08 09:23:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-08 09:23:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2018-12-08 09:23:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-12-08 09:23:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2018-12-08 09:23:47,258 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2018-12-08 09:23:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:47,258 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2018-12-08 09:23:47,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:23:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2018-12-08 09:23:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 09:23:47,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:47,259 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-08 09:23:47,259 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:47,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash -420532410, now seen corresponding path program 1 times [2018-12-08 09:23:47,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:47,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:47,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:47,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:47,293 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-08 09:23:47,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:47,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 09:23:47,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:23:47,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:23:47,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:23:47,294 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2018-12-08 09:23:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:47,385 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2018-12-08 09:23:47,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:23:47,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-08 09:23:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:47,387 INFO L225 Difference]: With dead ends: 448 [2018-12-08 09:23:47,387 INFO L226 Difference]: Without dead ends: 417 [2018-12-08 09:23:47,387 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-08 09:23:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-08 09:23:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-08 09:23:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-08 09:23:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-12-08 09:23:47,400 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2018-12-08 09:23:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:47,400 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-12-08 09:23:47,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:23:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-12-08 09:23:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 09:23:47,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:47,400 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-08 09:23:47,401 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:47,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2018-12-08 09:23:47,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:47,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:47,435 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-08 09:23:47,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:47,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:47,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:47,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:47,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:47,435 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2018-12-08 09:23:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:47,466 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2018-12-08 09:23:47,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:47,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-08 09:23:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:47,467 INFO L225 Difference]: With dead ends: 432 [2018-12-08 09:23:47,467 INFO L226 Difference]: Without dead ends: 399 [2018-12-08 09:23:47,468 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-08 09:23:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-08 09:23:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-12-08 09:23:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-08 09:23:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2018-12-08 09:23:47,479 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2018-12-08 09:23:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:47,479 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2018-12-08 09:23:47,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-12-08 09:23:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 09:23:47,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:47,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] [2018-12-08 09:23:47,480 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:47,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:47,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2018-12-08 09:23:47,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:47,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:47,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:47,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:47,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-08 09:23:47,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:47,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 09:23:47,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:23:47,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:23:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:23:47,517 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2018-12-08 09:23:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:47,614 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2018-12-08 09:23:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:23:47,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-12-08 09:23:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:47,615 INFO L225 Difference]: With dead ends: 429 [2018-12-08 09:23:47,615 INFO L226 Difference]: Without dead ends: 408 [2018-12-08 09:23:47,615 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-08 09:23:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-12-08 09:23:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-12-08 09:23:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-08 09:23:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-12-08 09:23:47,627 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2018-12-08 09:23:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:47,627 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-12-08 09:23:47,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:23:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-12-08 09:23:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 09:23:47,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:47,628 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-08 09:23:47,628 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:47,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:47,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2018-12-08 09:23:47,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:47,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:47,645 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-08 09:23:47,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:47,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:23:47,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:23:47,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:23:47,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:23:47,645 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-12-08 09:23:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:47,670 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-12-08 09:23:47,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:23:47,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-08 09:23:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:47,671 INFO L225 Difference]: With dead ends: 436 [2018-12-08 09:23:47,671 INFO L226 Difference]: Without dead ends: 410 [2018-12-08 09:23:47,671 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-08 09:23:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-08 09:23:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-12-08 09:23:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-08 09:23:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-12-08 09:23:47,683 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-12-08 09:23:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:47,683 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-12-08 09:23:47,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:23:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-12-08 09:23:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 09:23:47,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:47,683 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-08 09:23:47,684 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:47,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:47,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2018-12-08 09:23:47,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:47,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:47,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:47,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:47,714 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-08 09:23:47,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:47,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:23:47,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:23:47,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:23:47,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:23:47,715 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-12-08 09:23:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:48,100 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-12-08 09:23:48,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 09:23:48,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-08 09:23:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:48,102 INFO L225 Difference]: With dead ends: 565 [2018-12-08 09:23:48,102 INFO L226 Difference]: Without dead ends: 511 [2018-12-08 09:23:48,102 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-08 09:23:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-08 09:23:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-12-08 09:23:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-12-08 09:23:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-12-08 09:23:48,118 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-12-08 09:23:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:48,118 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-12-08 09:23:48,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:23:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-12-08 09:23:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 09:23:48,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:48,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] [2018-12-08 09:23:48,118 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:48,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2018-12-08 09:23:48,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:48,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:48,133 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-08 09:23:48,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:48,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:48,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:48,134 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-12-08 09:23:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:48,210 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-12-08 09:23:48,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:48,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-08 09:23:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:48,213 INFO L225 Difference]: With dead ends: 673 [2018-12-08 09:23:48,213 INFO L226 Difference]: Without dead ends: 659 [2018-12-08 09:23:48,214 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-08 09:23:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-08 09:23:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-12-08 09:23:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-12-08 09:23:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-12-08 09:23:48,249 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-12-08 09:23:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:48,249 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-12-08 09:23:48,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-12-08 09:23:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 09:23:48,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:48,250 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-08 09:23:48,250 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:48,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:48,251 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2018-12-08 09:23:48,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:48,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:48,299 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-08 09:23:48,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:48,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 09:23:48,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:23:48,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:23:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:23:48,300 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-12-08 09:23:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:48,353 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-12-08 09:23:48,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:23:48,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-12-08 09:23:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:48,355 INFO L225 Difference]: With dead ends: 598 [2018-12-08 09:23:48,355 INFO L226 Difference]: Without dead ends: 574 [2018-12-08 09:23:48,356 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-08 09:23:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-12-08 09:23:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-12-08 09:23:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-12-08 09:23:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-12-08 09:23:48,387 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-12-08 09:23:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:48,387 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-12-08 09:23:48,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:23:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-12-08 09:23:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 09:23:48,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:48,388 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-08 09:23:48,388 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:48,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:48,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2018-12-08 09:23:48,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:48,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:48,410 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-08 09:23:48,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:48,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:23:48,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:23:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:23:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:23:48,410 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-12-08 09:23:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:48,698 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-12-08 09:23:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:23:48,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-08 09:23:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:48,700 INFO L225 Difference]: With dead ends: 660 [2018-12-08 09:23:48,700 INFO L226 Difference]: Without dead ends: 624 [2018-12-08 09:23:48,700 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-08 09:23:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-12-08 09:23:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-12-08 09:23:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-12-08 09:23:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-12-08 09:23:48,720 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-12-08 09:23:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:48,721 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-12-08 09:23:48,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:23:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-12-08 09:23:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 09:23:48,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:48,721 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-08 09:23:48,721 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:48,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1927592443, now seen corresponding path program 1 times [2018-12-08 09:23:48,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:48,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:48,742 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-08 09:23:48,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:48,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:48,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:48,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:48,743 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-12-08 09:23:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:48,795 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-12-08 09:23:48,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:48,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-08 09:23:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:48,797 INFO L225 Difference]: With dead ends: 955 [2018-12-08 09:23:48,797 INFO L226 Difference]: Without dead ends: 527 [2018-12-08 09:23:48,799 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-08 09:23:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-12-08 09:23:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-12-08 09:23:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-12-08 09:23:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-12-08 09:23:48,818 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-12-08 09:23:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:48,818 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-12-08 09:23:48,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-12-08 09:23:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 09:23:48,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:48,819 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-08 09:23:48,819 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:48,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1553434371, now seen corresponding path program 1 times [2018-12-08 09:23:48,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:48,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:48,869 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-08 09:23:48,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:48,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 09:23:48,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 09:23:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 09:23:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:23:48,870 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-12-08 09:23:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:48,981 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-12-08 09:23:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 09:23:48,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-08 09:23:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:48,983 INFO L225 Difference]: With dead ends: 529 [2018-12-08 09:23:48,983 INFO L226 Difference]: Without dead ends: 466 [2018-12-08 09:23:48,983 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-08 09:23:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-08 09:23:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-12-08 09:23:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-12-08 09:23:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-12-08 09:23:48,999 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-12-08 09:23:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:49,000 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-12-08 09:23:49,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 09:23:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-12-08 09:23:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 09:23:49,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:49,000 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-08 09:23:49,001 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:49,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:49,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1051956534, now seen corresponding path program 1 times [2018-12-08 09:23:49,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:49,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:49,032 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-08 09:23:49,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:49,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:49,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:49,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:49,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:49,032 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-12-08 09:23:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:49,073 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-12-08 09:23:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:49,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-08 09:23:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:49,076 INFO L225 Difference]: With dead ends: 918 [2018-12-08 09:23:49,076 INFO L226 Difference]: Without dead ends: 491 [2018-12-08 09:23:49,078 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-08 09:23:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-12-08 09:23:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-12-08 09:23:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-08 09:23:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-12-08 09:23:49,106 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-12-08 09:23:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:49,106 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-12-08 09:23:49,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-12-08 09:23:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 09:23:49,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:49,107 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-08 09:23:49,107 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:49,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1770735671, now seen corresponding path program 1 times [2018-12-08 09:23:49,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:49,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:49,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:49,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:49,133 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-08 09:23:49,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:49,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:23:49,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:23:49,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:23:49,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:23:49,134 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-12-08 09:23:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:49,204 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-12-08 09:23:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:23:49,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-08 09:23:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:49,206 INFO L225 Difference]: With dead ends: 730 [2018-12-08 09:23:49,207 INFO L226 Difference]: Without dead ends: 727 [2018-12-08 09:23:49,227 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-08 09:23:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-08 09:23:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-12-08 09:23:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-12-08 09:23:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-12-08 09:23:49,248 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-12-08 09:23:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:49,248 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-12-08 09:23:49,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:23:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-12-08 09:23:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 09:23:49,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:49,249 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-08 09:23:49,249 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:49,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1533013073, now seen corresponding path program 1 times [2018-12-08 09:23:49,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:49,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:49,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:49,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:49,341 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-08 09:23:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:49,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:49,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:49,342 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 6 states. [2018-12-08 09:23:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:49,386 INFO L93 Difference]: Finished difference Result 755 states and 1177 transitions. [2018-12-08 09:23:49,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:49,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-08 09:23:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:49,388 INFO L225 Difference]: With dead ends: 755 [2018-12-08 09:23:49,388 INFO L226 Difference]: Without dead ends: 312 [2018-12-08 09:23:49,390 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-08 09:23:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-08 09:23:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-12-08 09:23:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-08 09:23:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 435 transitions. [2018-12-08 09:23:49,413 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 435 transitions. Word has length 65 [2018-12-08 09:23:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:49,413 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 435 transitions. [2018-12-08 09:23:49,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 435 transitions. [2018-12-08 09:23:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 09:23:49,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:49,414 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-08 09:23:49,414 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:49,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash -620931734, now seen corresponding path program 1 times [2018-12-08 09:23:49,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:49,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:49,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:49,459 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-08 09:23:49,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:49,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:23:49,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:23:49,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:23:49,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:23:49,459 INFO L87 Difference]: Start difference. First operand 312 states and 435 transitions. Second operand 5 states. [2018-12-08 09:23:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:49,598 INFO L93 Difference]: Finished difference Result 579 states and 830 transitions. [2018-12-08 09:23:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:23:49,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-08 09:23:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:49,599 INFO L225 Difference]: With dead ends: 579 [2018-12-08 09:23:49,599 INFO L226 Difference]: Without dead ends: 307 [2018-12-08 09:23:49,600 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-08 09:23:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-08 09:23:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-12-08 09:23:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-08 09:23:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-12-08 09:23:49,616 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-12-08 09:23:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:49,616 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-12-08 09:23:49,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:23:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-12-08 09:23:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 09:23:49,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:49,617 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-08 09:23:49,617 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:49,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:49,617 INFO L82 PathProgramCache]: Analyzing trace with hash 438765614, now seen corresponding path program 1 times [2018-12-08 09:23:49,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:49,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:49,684 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-08 09:23:49,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:49,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:23:49,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:23:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:23:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:23:49,685 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 5 states. [2018-12-08 09:23:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:50,005 INFO L93 Difference]: Finished difference Result 669 states and 953 transitions. [2018-12-08 09:23:50,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:50,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-08 09:23:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:50,007 INFO L225 Difference]: With dead ends: 669 [2018-12-08 09:23:50,007 INFO L226 Difference]: Without dead ends: 405 [2018-12-08 09:23:50,008 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-08 09:23:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-12-08 09:23:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 363. [2018-12-08 09:23:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-08 09:23:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 503 transitions. [2018-12-08 09:23:50,032 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 503 transitions. Word has length 70 [2018-12-08 09:23:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:50,032 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 503 transitions. [2018-12-08 09:23:50,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:23:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 503 transitions. [2018-12-08 09:23:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 09:23:50,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:50,032 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-08 09:23:50,033 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1587959962, now seen corresponding path program 1 times [2018-12-08 09:23:50,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:50,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:50,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:50,092 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-08 09:23:50,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:50,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:50,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:50,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:50,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:50,093 INFO L87 Difference]: Start difference. First operand 363 states and 503 transitions. Second operand 6 states. [2018-12-08 09:23:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:50,126 INFO L93 Difference]: Finished difference Result 691 states and 982 transitions. [2018-12-08 09:23:50,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:50,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-08 09:23:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:50,128 INFO L225 Difference]: With dead ends: 691 [2018-12-08 09:23:50,128 INFO L226 Difference]: Without dead ends: 369 [2018-12-08 09:23:50,129 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-08 09:23:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-08 09:23:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-12-08 09:23:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-08 09:23:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 505 transitions. [2018-12-08 09:23:50,148 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 505 transitions. Word has length 72 [2018-12-08 09:23:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:50,148 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 505 transitions. [2018-12-08 09:23:50,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 505 transitions. [2018-12-08 09:23:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 09:23:50,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:50,149 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-08 09:23:50,149 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:50,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1286621045, now seen corresponding path program 1 times [2018-12-08 09:23:50,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:50,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:50,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:50,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:50,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:50,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:50,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:50,193 INFO L87 Difference]: Start difference. First operand 366 states and 505 transitions. Second operand 6 states. [2018-12-08 09:23:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:50,422 INFO L93 Difference]: Finished difference Result 642 states and 895 transitions. [2018-12-08 09:23:50,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:23:50,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-08 09:23:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:50,424 INFO L225 Difference]: With dead ends: 642 [2018-12-08 09:23:50,424 INFO L226 Difference]: Without dead ends: 337 [2018-12-08 09:23:50,425 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-08 09:23:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-08 09:23:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-12-08 09:23:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-08 09:23:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 441 transitions. [2018-12-08 09:23:50,451 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 441 transitions. Word has length 83 [2018-12-08 09:23:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:50,452 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 441 transitions. [2018-12-08 09:23:50,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 441 transitions. [2018-12-08 09:23:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:23:50,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:50,453 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-08 09:23:50,453 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:50,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:50,453 INFO L82 PathProgramCache]: Analyzing trace with hash -49085271, now seen corresponding path program 1 times [2018-12-08 09:23:50,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:50,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:50,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:50,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:50,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:50,555 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-08 09:23:50,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:50,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-08 09:23:50,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 09:23:50,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 09:23:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-08 09:23:50,557 INFO L87 Difference]: Start difference. First operand 329 states and 441 transitions. Second operand 15 states. [2018-12-08 09:23:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:50,683 INFO L93 Difference]: Finished difference Result 626 states and 853 transitions. [2018-12-08 09:23:50,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 09:23:50,684 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-12-08 09:23:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:50,685 INFO L225 Difference]: With dead ends: 626 [2018-12-08 09:23:50,685 INFO L226 Difference]: Without dead ends: 333 [2018-12-08 09:23:50,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-12-08 09:23:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-08 09:23:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2018-12-08 09:23:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-12-08 09:23:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 443 transitions. [2018-12-08 09:23:50,712 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 443 transitions. Word has length 92 [2018-12-08 09:23:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:50,712 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 443 transitions. [2018-12-08 09:23:50,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 09:23:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 443 transitions. [2018-12-08 09:23:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 09:23:50,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:50,714 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-08 09:23:50,714 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:50,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310540, now seen corresponding path program 1 times [2018-12-08 09:23:50,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:50,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:50,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:50,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:50,835 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-08 09:23:50,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:50,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 09:23:50,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 09:23:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 09:23:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 09:23:50,835 INFO L87 Difference]: Start difference. First operand 332 states and 443 transitions. Second operand 14 states. [2018-12-08 09:23:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:51,597 INFO L93 Difference]: Finished difference Result 364 states and 472 transitions. [2018-12-08 09:23:51,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 09:23:51,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-12-08 09:23:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:51,598 INFO L225 Difference]: With dead ends: 364 [2018-12-08 09:23:51,598 INFO L226 Difference]: Without dead ends: 322 [2018-12-08 09:23:51,599 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-08 09:23:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-08 09:23:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2018-12-08 09:23:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-12-08 09:23:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 423 transitions. [2018-12-08 09:23:51,613 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 423 transitions. Word has length 103 [2018-12-08 09:23:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:51,613 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 423 transitions. [2018-12-08 09:23:51,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 09:23:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 423 transitions. [2018-12-08 09:23:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 09:23:51,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:51,614 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-08 09:23:51,614 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:51,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash -12169486, now seen corresponding path program 1 times [2018-12-08 09:23:51,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:51,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:51,703 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-08 09:23:51,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:51,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-08 09:23:51,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 09:23:51,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 09:23:51,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-08 09:23:51,703 INFO L87 Difference]: Start difference. First operand 317 states and 423 transitions. Second operand 15 states. [2018-12-08 09:23:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:51,832 INFO L93 Difference]: Finished difference Result 353 states and 468 transitions. [2018-12-08 09:23:51,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 09:23:51,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-12-08 09:23:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:51,833 INFO L225 Difference]: With dead ends: 353 [2018-12-08 09:23:51,834 INFO L226 Difference]: Without dead ends: 326 [2018-12-08 09:23:51,834 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-08 09:23:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-08 09:23:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-12-08 09:23:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-08 09:23:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-12-08 09:23:51,853 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 108 [2018-12-08 09:23:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:51,853 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-12-08 09:23:51,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 09:23:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-12-08 09:23:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 09:23:51,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:51,855 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-08 09:23:51,855 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:51,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:51,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1168498032, now seen corresponding path program 1 times [2018-12-08 09:23:51,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:51,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:51,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:51,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:51,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:51,910 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-08 09:23:51,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:51,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:23:51,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:23:51,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:23:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:23:51,911 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 5 states. [2018-12-08 09:23:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:52,114 INFO L93 Difference]: Finished difference Result 709 states and 929 transitions. [2018-12-08 09:23:52,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:52,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-12-08 09:23:52,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:52,116 INFO L225 Difference]: With dead ends: 709 [2018-12-08 09:23:52,116 INFO L226 Difference]: Without dead ends: 447 [2018-12-08 09:23:52,117 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-08 09:23:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-08 09:23:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-12-08 09:23:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-08 09:23:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-12-08 09:23:52,136 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 132 [2018-12-08 09:23:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:52,136 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-12-08 09:23:52,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:23:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-12-08 09:23:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 09:23:52,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:52,138 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-08 09:23:52,138 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:52,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash 587949524, now seen corresponding path program 1 times [2018-12-08 09:23:52,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:52,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:52,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:52,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:52,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:52,272 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-08 09:23:52,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:52,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 09:23:52,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 09:23:52,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 09:23:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 09:23:52,273 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 14 states. [2018-12-08 09:23:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:52,998 INFO L93 Difference]: Finished difference Result 405 states and 514 transitions. [2018-12-08 09:23:52,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 09:23:52,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-12-08 09:23:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:52,999 INFO L225 Difference]: With dead ends: 405 [2018-12-08 09:23:52,999 INFO L226 Difference]: Without dead ends: 341 [2018-12-08 09:23:52,999 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-08 09:23:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-12-08 09:23:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 275. [2018-12-08 09:23:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-08 09:23:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2018-12-08 09:23:53,013 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 120 [2018-12-08 09:23:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:53,013 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2018-12-08 09:23:53,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 09:23:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2018-12-08 09:23:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 09:23:53,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:53,014 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-08 09:23:53,014 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:53,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2028223534, now seen corresponding path program 1 times [2018-12-08 09:23:53,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:53,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:53,052 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-08 09:23:53,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:53,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:53,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:53,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:53,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:53,053 INFO L87 Difference]: Start difference. First operand 275 states and 333 transitions. Second operand 6 states. [2018-12-08 09:23:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:53,094 INFO L93 Difference]: Finished difference Result 468 states and 592 transitions. [2018-12-08 09:23:53,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:53,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-12-08 09:23:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:53,096 INFO L225 Difference]: With dead ends: 468 [2018-12-08 09:23:53,096 INFO L226 Difference]: Without dead ends: 322 [2018-12-08 09:23:53,097 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-08 09:23:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-08 09:23:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-12-08 09:23:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 09:23:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 320 transitions. [2018-12-08 09:23:53,120 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 320 transitions. Word has length 121 [2018-12-08 09:23:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:53,120 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 320 transitions. [2018-12-08 09:23:53,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 320 transitions. [2018-12-08 09:23:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-08 09:23:53,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:53,121 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-08 09:23:53,121 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:53,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1150164970, now seen corresponding path program 1 times [2018-12-08 09:23:53,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:53,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:53,170 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-08 09:23:53,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:23:53,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:23:53,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:53,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-08 09:23:53,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:23:53,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-08 09:23:53,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:23:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:23:53,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:23:53,336 INFO L87 Difference]: Start difference. First operand 269 states and 320 transitions. Second operand 7 states. [2018-12-08 09:23:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:53,405 INFO L93 Difference]: Finished difference Result 425 states and 518 transitions. [2018-12-08 09:23:53,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:23:53,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2018-12-08 09:23:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:53,406 INFO L225 Difference]: With dead ends: 425 [2018-12-08 09:23:53,406 INFO L226 Difference]: Without dead ends: 279 [2018-12-08 09:23:53,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:23:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-08 09:23:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-12-08 09:23:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-08 09:23:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2018-12-08 09:23:53,421 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 163 [2018-12-08 09:23:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:53,421 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2018-12-08 09:23:53,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:23:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-12-08 09:23:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 09:23:53,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:53,422 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-08 09:23:53,422 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:53,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash -974469450, now seen corresponding path program 1 times [2018-12-08 09:23:53,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:53,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:53,468 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-08 09:23:53,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:53,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:53,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:53,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:53,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:53,469 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand 6 states. [2018-12-08 09:23:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:53,508 INFO L93 Difference]: Finished difference Result 435 states and 525 transitions. [2018-12-08 09:23:53,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:53,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-12-08 09:23:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:53,509 INFO L225 Difference]: With dead ends: 435 [2018-12-08 09:23:53,509 INFO L226 Difference]: Without dead ends: 303 [2018-12-08 09:23:53,509 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-08 09:23:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-08 09:23:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2018-12-08 09:23:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-12-08 09:23:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 316 transitions. [2018-12-08 09:23:53,524 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 316 transitions. Word has length 164 [2018-12-08 09:23:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:53,525 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 316 transitions. [2018-12-08 09:23:53,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 316 transitions. [2018-12-08 09:23:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-08 09:23:53,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:53,526 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-08 09:23:53,526 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:53,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1046099915, now seen corresponding path program 1 times [2018-12-08 09:23:53,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:53,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:53,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:53,584 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-08 09:23:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:53,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:53,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:53,585 INFO L87 Difference]: Start difference. First operand 270 states and 316 transitions. Second operand 6 states. [2018-12-08 09:23:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:53,620 INFO L93 Difference]: Finished difference Result 326 states and 379 transitions. [2018-12-08 09:23:53,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:53,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-12-08 09:23:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:53,622 INFO L225 Difference]: With dead ends: 326 [2018-12-08 09:23:53,622 INFO L226 Difference]: Without dead ends: 255 [2018-12-08 09:23:53,622 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-08 09:23:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-08 09:23:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2018-12-08 09:23:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-08 09:23:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 280 transitions. [2018-12-08 09:23:53,641 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 280 transitions. Word has length 204 [2018-12-08 09:23:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:53,642 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 280 transitions. [2018-12-08 09:23:53,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 280 transitions. [2018-12-08 09:23:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 09:23:53,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:53,643 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-08 09:23:53,643 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:53,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:53,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1129206307, now seen corresponding path program 1 times [2018-12-08 09:23:53,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:53,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:53,730 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-08 09:23:53,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:53,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:53,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:23:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:53,731 INFO L87 Difference]: Start difference. First operand 241 states and 280 transitions. Second operand 6 states. [2018-12-08 09:23:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:53,765 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2018-12-08 09:23:53,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:53,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-12-08 09:23:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:53,766 INFO L225 Difference]: With dead ends: 241 [2018-12-08 09:23:53,766 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 09:23:53,767 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-08 09:23:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 09:23:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 09:23:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 09:23:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 09:23:53,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-12-08 09:23:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:53,768 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:23:53,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:23:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:23:53,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 09:23:53,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 09:23:53,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:53,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:54,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:23:55,237 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-12-08 09:23:55,985 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-12-08 09:23:56,400 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-12-08 09:23:56,628 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2018-12-08 09:23:57,398 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-12-08 09:23:57,856 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2018-12-08 09:23:58,149 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-12-08 09:23:58,366 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2018-12-08 09:23:58,660 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2018-12-08 09:23:59,053 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-12-08 09:23:59,329 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-12-08 09:23:59,637 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-12-08 09:23:59,842 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-12-08 09:24:00,003 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-12-08 09:24:00,145 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2018-12-08 09:24:00,579 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-12-08 09:24:00,874 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-12-08 09:24:00,964 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-12-08 09:24:00,964 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-08 09:24:00,964 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-12-08 09:24:00,964 INFO L451 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-12-08 09:24:00,964 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-12-08 09:24:00,965 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-08 09:24:00,965 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-08 09:24:00,965 INFO L448 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-12-08 09:24:00,965 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-12-08 09:24:00,965 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-08 09:24:00,965 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-08 09:24:00,965 INFO L448 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-12-08 09:24:00,966 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-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-12-08 09:24:00,966 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-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-12-08 09:24:00,966 INFO L448 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-12-08 09:24:00,967 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-08 09:24:00,967 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-08 09:24:00,967 INFO L448 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-12-08 09:24:00,967 INFO L448 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-12-08 09:24:00,967 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-08 09:24:00,967 INFO L448 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-12-08 09:24:00,967 INFO L448 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-12-08 09:24:00,967 INFO L448 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-12-08 09:24:00,967 INFO L444 ceAbstractionStarter]: At program point L692-2(lines 692 695) 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 (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~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-08 09:24:00,967 INFO L444 ceAbstractionStarter]: At program point L717(lines 716 763) 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 (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~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-08 09:24:00,967 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-12-08 09:24:00,968 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-08 09:24:00,968 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-12-08 09:24:00,968 INFO L448 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-12-08 09:24:00,968 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-08 09:24:00,968 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-08 09:24:00,968 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-12-08 09:24:00,968 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-12-08 09:24:00,968 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-08 09:24:00,968 INFO L448 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-12-08 09:24:00,968 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-12-08 09:24:00,968 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-08 09:24:00,969 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-08 09:24:00,969 INFO L451 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-12-08 09:24:00,969 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-12-08 09:24:00,969 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-12-08 09:24:00,969 INFO L448 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-12-08 09:24:00,969 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (= ~myStatus~0 259) (< ~setEventCalled~0 1) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~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) (< 1 ~setEventCalled~0)) [2018-12-08 09:24:00,969 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-12-08 09:24:00,969 INFO L444 ceAbstractionStarter]: At program point L866(line 866) the Hoare annotation is: (or (= ~myStatus~0 259) (< ~setEventCalled~0 1) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~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) (< 1 ~setEventCalled~0)) [2018-12-08 09:24:00,969 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-08 09:24:00,969 INFO L448 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-12-08 09:24:00,969 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-12-08 09:24:00,970 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-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-12-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-12-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-12-08 09:24:00,970 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-08 09:24:00,970 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-08 09:24:00,970 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-08 09:24:00,970 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-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-12-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-12-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-12-08 09:24:00,970 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-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-12-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-12-08 09:24:00,970 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-12-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-12-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-12-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-12-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-12-08 09:24:00,971 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-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-12-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-12-08 09:24:00,971 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-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-12-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-12-08 09:24:00,971 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-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-12-08 09:24:00,971 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-12-08 09:24:00,971 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-08 09:24:00,971 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-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-12-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-12-08 09:24:00,972 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-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-12-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-12-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-12-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-12-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-12-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-12-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-12-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-12-08 09:24:00,972 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-08 09:24:00,972 INFO L448 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-12-08 09:24:00,973 INFO L444 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse7 (= ~myStatus~0 259)) (.cse10 (<= 1 ~s~0)) (.cse13 (+ ~DC~0 5)) (.cse14 (+ ~SKIP1~0 2))) (let ((.cse6 (< ~MPR1~0 .cse14)) (.cse8 (< |old(~setEventCalled~0)| 1)) (.cse9 (< ~compRegistered~0 1)) (.cse5 (not (= 0 ~routine~0))) (.cse1 (= 1 ~pended~0)) (.cse11 (< ~IPC~0 .cse13)) (.cse0 (and (not .cse7) (<= .cse13 ~IPC~0) (= ~s~0 ~NP~0) (<= .cse14 ~MPR1~0) (<= 1 ~compRegistered~0) .cse10 (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse12 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse8 .cse9 (and (= |old(~customIrp~0)| 1) (and .cse10 (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= 0 ~customIrp~0)) .cse11 (< |old(~s~0)| 1) .cse12) (or .cse6 .cse7 .cse8 (< ~NP~0 1) (or .cse9 (or .cse5 .cse1 .cse11)) .cse0 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 .cse4 .cse12)))) [2018-12-08 09:24:00,973 INFO L444 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse7 (= ~myStatus~0 259)) (.cse10 (<= 1 ~s~0)) (.cse13 (+ ~DC~0 5)) (.cse14 (+ ~SKIP1~0 2))) (let ((.cse6 (< ~MPR1~0 .cse14)) (.cse8 (< |old(~setEventCalled~0)| 1)) (.cse9 (< ~compRegistered~0 1)) (.cse5 (not (= 0 ~routine~0))) (.cse1 (= 1 ~pended~0)) (.cse11 (< ~IPC~0 .cse13)) (.cse0 (and (not .cse7) (<= .cse13 ~IPC~0) (= ~s~0 ~NP~0) (<= .cse14 ~MPR1~0) (<= 1 ~compRegistered~0) .cse10 (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse12 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse8 .cse9 (and (= |old(~customIrp~0)| 1) (and .cse10 (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= 0 ~customIrp~0)) .cse11 (< |old(~s~0)| 1) .cse12) (or .cse6 .cse7 .cse8 (< ~NP~0 1) (or .cse9 (or .cse5 .cse1 .cse11)) .cse0 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 .cse4 .cse12)))) [2018-12-08 09:24:00,973 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-08 09:24:00,973 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-08 09:24:00,973 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-12-08 09:24:00,973 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-12-08 09:24:00,973 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-08 09:24:00,973 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-12-08 09:24:00,973 INFO L451 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2018-12-08 09:24:00,973 INFO L451 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-12-08 09:24:00,974 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~s~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-12-08 09:24:00,974 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-12-08 09:24:00,974 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:00,974 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-12-08 09:24:00,974 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-08 09:24:00,974 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-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-12-08 09:24:00,975 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-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-12-08 09:24:00,975 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 (and (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2) (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) .cse0 .cse1 .cse2))) [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-12-08 09:24:00,975 INFO L444 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-12-08 09:24:00,975 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L444 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L444 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,976 INFO L444 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L444 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L444 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-12-08 09:24:00,976 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (let ((.cse0 (not (= 0 DiskPerfRegisterDevice_~output~0))) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1)) (.cse4 (= 259 DiskPerfRegisterDevice_~__cil_tmp32~0))) (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (and .cse0 (= ~s~0 ~MPR3~0) .cse1 .cse2 .cse3) .cse4) (and (and .cse0 (<= 1 ~s~0) (<= ~s~0 1) .cse1 .cse2 .cse3) .cse4))) [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L444 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L444 ceAbstractionStarter]: At program point L520(line 520) the Hoare annotation is: (let ((.cse0 (= 259 DiskPerfRegisterDevice_~__cil_tmp23~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) .cse0 (<= ~s~0 1) .cse1 .cse2 .cse3) (and (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2 .cse3))) [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L444 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-12-08 09:24:00,977 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-12-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-12-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-12-08 09:24:00,978 INFO L444 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-12-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-12-08 09:24:00,978 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse0 (= 259 DiskPerfRegisterDevice_~__cil_tmp27~0)) (.cse1 (not (= 0 DiskPerfRegisterDevice_~output~0))) (.cse2 (not (= ~pended~0 1))) (.cse3 (<= 1 ~setEventCalled~0)) (.cse4 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and .cse0 .cse1 (= ~s~0 ~MPR3~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 1 ~s~0) (<= ~s~0 1) .cse2 .cse3 .cse4))) [2018-12-08 09:24:00,978 INFO L444 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~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) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-12-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-12-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-12-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-12-08 09:24:00,978 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-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-12-08 09:24:00,978 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-12-08 09:24:00,979 INFO L444 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse7 (= 1 |old(~pended~0)|)) (.cse8 (< ~MPR1~0 (+ ~NP~0 4))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< 1 ~NP~0)) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (= ~myStatus~0 259)) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (< ~IPC~0 (+ ~DC~0 5))) (.cse17 (< |old(~s~0)| 1))) (and (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (= ~routine~0 0)) (.cse2 (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259)) (.cse3 (< 258 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= 1 ~setEventCalled~0)) (.cse6 (<= ~setEventCalled~0 1))) (or (and .cse0 .cse1 (= ~s~0 ~MPR3~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (= 259 DiskPerfForwardIrpSynchronous_~status~3)) (<= 1 ~s~0) .cse1 .cse2 (<= ~s~0 1) .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (or (= |old(~customIrp~0)| ~customIrp~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |old(~customIrp~0)| 0))))) [2018-12-08 09:24:00,979 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-12-08 09:24:00,979 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-12-08 09:24:00,979 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-12-08 09:24:00,979 INFO L444 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.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))) (.cse10 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |old(~customIrp~0)| ~customIrp~0) .cse9 .cse10 (not (= |old(~customIrp~0)| 0))))) [2018-12-08 09:24:00,979 INFO L444 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.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))) (.cse10 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |old(~customIrp~0)| ~customIrp~0) .cse8 .cse9 .cse10 (not (= |old(~customIrp~0)| 0))) (or (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-08 09:24:00,979 INFO L448 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-12-08 09:24:00,979 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-12-08 09:24:00,979 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-08 09:24:00,979 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)|) (< ~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) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:00,979 INFO L448 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-12-08 09:24:00,979 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-12-08 09:24:00,980 INFO L444 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= ~s~0 1)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and .cse0 .cse1 .cse2 (not (= 259 DiskPerfStartDevice_~status~1)) .cse3 .cse4 .cse5 .cse6 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and .cse0 .cse1 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 09:24:00,980 INFO L444 ceAbstractionStarter]: At program point L156(line 156) 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)) (= |old(~myStatus~0)| 259) (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))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:00,980 INFO L444 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= ~s~0 1)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and .cse0 .cse1 .cse2 (not (= 259 DiskPerfStartDevice_~status~1)) .cse3 .cse4 .cse5 .cse6 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and .cse0 .cse1 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) [2018-12-08 09:24:00,980 INFO L444 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) 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)) (= |old(~myStatus~0)| 259) (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))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:00,980 INFO L448 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-12-08 09:24:00,980 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-12-08 09:24:00,980 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-12-08 09:24:00,980 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-08 09:24:00,980 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-08 09:24:00,980 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-12-08 09:24:00,980 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-08 09:24:00,980 INFO L448 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-12-08 09:24:00,980 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-12-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-12-08 09:24:00,981 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-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-12-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-12-08 09:24:00,981 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-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-12-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-12-08 09:24:00,981 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-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-12-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-12-08 09:24:00,981 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-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-12-08 09:24:00,981 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-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-12-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-12-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-12-08 09:24:00,981 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-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-12-08 09:24:00,981 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-12-08 09:24:00,982 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-08 09:24:00,982 INFO L448 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-12-08 09:24:00,982 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-08 09:24:00,982 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-12-08 09:24:00,983 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-12-08 09:24:00,983 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-12-08 09:24:00,983 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-12-08 09:24:00,983 INFO L451 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-12-08 09:24:00,984 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-12-08 09:24:00,984 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-12-08 09:24:00,984 INFO L444 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse3 (not (= ~compRegistered~0 0))) (.cse0 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or (= ~myStatus~0 259) (or (or .cse0 .cse6 .cse1 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse7 0) (<= 0 .cse7) (<= 1 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse8) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse8 1) 0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))))) [2018-12-08 09:24:00,984 INFO L444 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (or (or .cse1 .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-12-08 09:24:00,984 INFO L444 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse3 (not (= ~compRegistered~0 0))) (.cse0 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or (= ~myStatus~0 259) (or (or .cse0 .cse6 .cse1 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))))) [2018-12-08 09:24:00,984 INFO L448 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-12-08 09:24:00,984 INFO L444 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse0 (not (= 0 ~routine~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse3 (= 1 |old(~pended~0)|)) (.cse6 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (= ~myStatus~0 259) (or (or .cse0 .cse1 .cse2 .cse3 (< ~compRegistered~0 1) .cse4 .cse5) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) (or .cse0 .cse2 .cse3 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 .cse1 .cse3 .cse6 .cse4 .cse5))) [2018-12-08 09:24:00,987 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (or (or .cse1 .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (and (<= 1 ~s~0) (<= ~s~0 1) .cse0)) (or .cse1 .cse7 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-12-08 09:24:00,987 INFO L448 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-12-08 09:24:00,987 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-12-08 09:24:00,987 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-12-08 09:24:00,987 INFO L448 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-12-08 09:24:00,987 INFO L444 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse7 0) (<= 0 .cse7) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse8) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse8 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (or (or .cse1 .cse2 .cse9 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))) (or .cse1 .cse9 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-12-08 09:24:00,987 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-12-08 09:24:00,987 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-12-08 09:24:00,987 INFO L448 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-12-08 09:24:00,987 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-12-08 09:24:00,987 INFO L444 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (or (or .cse1 .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-12-08 09:24:00,990 INFO L448 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-12-08 09:24:00,990 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-12-08 09:24:00,990 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-12-08 09:24:00,990 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-12-08 09:24:00,990 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-12-08 09:24:00,990 INFO L448 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-12-08 09:24:00,990 INFO L444 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse3 (not (= ~compRegistered~0 0))) (.cse0 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or (= ~myStatus~0 259) (or (or .cse0 .cse6 .cse1 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))))) [2018-12-08 09:24:00,990 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-12-08 09:24:00,990 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-12-08 09:24:00,990 INFO L444 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (or (or .cse1 .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-12-08 09:24:00,991 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-12-08 09:24:00,991 INFO L451 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2018-12-08 09:24:00,995 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-12-08 09:24:00,995 INFO L451 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-12-08 09:24:00,995 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-12-08 09:24:00,995 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-12-08 09:24:00,995 INFO L448 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-12-08 09:24:00,995 INFO L451 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L451 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L444 ceAbstractionStarter]: At program point L128(lines 111 129) 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)) (= |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)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-08 09:24:00,996 INFO L444 ceAbstractionStarter]: At program point L110(lines 109 130) 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)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (and (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:01,002 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)|) (< ~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) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:01,002 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-12-08 09:24:01,003 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) 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)) (= |old(~myStatus~0)| 259) (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))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:01,003 INFO L444 ceAbstractionStarter]: At program point L105(lines 104 131) 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)) (= |old(~myStatus~0)| 259) (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))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-12-08 09:24:01,003 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-12-08 09:24:01,003 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-12-08 09:24:01,003 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 09:24:01,003 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-08 09:24:01,003 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 09:24:01,003 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 09:24:01,003 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-08 09:24:01,003 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 09:24:01,003 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 09:24:01,003 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-08 09:24:01,009 INFO L448 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-12-08 09:24:01,010 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-12-08 09:24:01,010 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-12-08 09:24:01,010 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-08 09:24:01,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 09:24:01 BoogieIcfgContainer [2018-12-08 09:24:01,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 09:24:01,042 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:24:01,042 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:24:01,042 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:24:01,043 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:23:44" (3/4) ... [2018-12-08 09:24:01,046 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-12-08 09:24:01,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-12-08 09:24:01,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 09:24:01,054 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-12-08 09:24:01,065 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2018-12-08 09:24:01,066 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-12-08 09:24:01,067 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 09:24:01,068 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 09:24:01,094 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-08 09:24:01,094 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-08 09:24:01,094 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-08 09:24:01,096 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(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 && ((1 <= s && s <= 1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || 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) || ((((((((!(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)) [2018-12-08 09:24:01,096 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(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 && ((1 <= s && s <= 1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || 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) || ((((((((!(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)) [2018-12-08 09:24:01,096 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-08 09:24:01,096 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) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((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))) && (((((((!(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-08 09:24:01,096 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-08 09:24:01,097 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-08 09:24:01,097 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) && ((myStatus == 259 || ((((((((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)) || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) && (((((((!(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-08 09:24:01,097 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 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)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) [2018-12-08 09:24:01,097 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-08 09:24:01,098 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((myStatus == 259 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((1 <= s && s <= 1) && !(pended == 1)) [2018-12-08 09:24:01,098 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-08 09:24:01,098 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-08 09:24:01,098 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-08 09:24:01,099 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) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((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))) && (((((((!(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-08 09:24:01,099 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) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((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))) && (((((((!(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-08 09:24:01,099 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-08 09:24:01,100 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))) || (((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && NP + 4 <= MPR1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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-08 09:24:01,100 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-08 09:24:01,101 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-08 09:24:01,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) [2018-12-08 09:24:01,101 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)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) [2018-12-08 09:24:01,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || \old(s) < 1) || !(\old(customIrp) == 0) [2018-12-08 09:24:01,102 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-08 09:24:01,103 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-08 09:24:01,177 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a5bf02b-d006-4278-8148-50ed58f73720/bin-2019/uautomizer/witness.graphml [2018-12-08 09:24:01,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:24:01,178 INFO L168 Benchmark]: Toolchain (without parser) took 17824.16 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 636.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 508.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:01,179 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:24:01,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:01,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:24:01,179 INFO L168 Benchmark]: Boogie Preprocessor took 30.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:01,180 INFO L168 Benchmark]: RCFGBuilder took 491.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:01,180 INFO L168 Benchmark]: TraceAbstraction took 16858.92 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 511.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.7 MB). Peak memory consumption was 698.0 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:01,180 INFO L168 Benchmark]: Witness Printer took 135.67 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:01,181 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 491.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16858.92 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 511.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.7 MB). Peak memory consumption was 698.0 MB. Max. memory is 11.5 GB. * Witness Printer took 135.67 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 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: ((((((((((((((((((((((!(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 && ((1 <= s && s <= 1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || 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) || ((((((((!(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)) - 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: ((((((((((((((((((((((!(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 && ((1 <= s && s <= 1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || 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) || ((((((((!(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)) - InvariantResult [Line: 908]: 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) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((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))) && (((((((!(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: 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: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((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))) && (((((((!(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) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && NP + 4 <= MPR1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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) && ((myStatus == 259 || ((((((((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)) || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) && (((((((!(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: 109]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || \old(s) < 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)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\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) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 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)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\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: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((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))) && (((((((!(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 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((1 <= s && s <= 1) && !(pended == 1)) - 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, 16.7s OverallTime, 43 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 7.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 12824 SDtfs, 6672 SDslu, 33748 SDs, 0 SdLazy, 8352 SolverSat, 1301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 268 SyntacticMatches, 10 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s 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.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 43 MinimizatonAttempts, 1145 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4255 PreInvPairs, 4466 NumberOfFragments, 8314 HoareAnnotationTreeSize, 4255 FomulaSimplifications, 30209 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 109 FomulaSimplificationsInter, 26900 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3229 NumberOfCodeBlocks, 3229 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3185 ConstructedInterpolants, 0 QuantifiedInterpolants, 462416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 44 InterpolantComputations, 43 PerfectInterpolantSequences, 668/674 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...