./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/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_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/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-0cd3be1 [2018-11-28 11:44:19,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:44:19,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:44:19,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:44:19,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:44:19,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:44:19,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:44:19,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:44:19,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:44:19,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:44:19,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:44:19,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:44:19,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:44:19,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:44:19,475 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:44:19,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:44:19,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:44:19,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:44:19,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:44:19,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:44:19,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:44:19,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:44:19,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:44:19,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:44:19,484 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:44:19,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:44:19,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:44:19,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:44:19,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:44:19,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:44:19,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:44:19,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:44:19,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:44:19,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:44:19,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:44:19,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:44:19,489 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:44:19,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:44:19,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:44:19,500 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:44:19,500 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:44:19,500 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:44:19,500 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:44:19,500 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:44:19,501 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:44:19,501 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:44:19,502 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:44:19,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:44:19,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:44:19,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:44:19,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:44:19,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:44:19,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:44:19,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:44:19,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:44:19,503 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:44:19,503 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:44:19,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:44:19,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:44:19,503 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_45196494-0ff7-4452-be9b-93588f465e67/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-11-28 11:44:19,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:44:19,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:44:19,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:44:19,535 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:44:19,536 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:44:19,536 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 11:44:19,574 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/data/863342df7/24d3afb77bb149fb94d27aef9efc5e17/FLAGec5c9e50a [2018-11-28 11:44:19,911 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:44:19,912 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 11:44:19,918 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/data/863342df7/24d3afb77bb149fb94d27aef9efc5e17/FLAGec5c9e50a [2018-11-28 11:44:19,929 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/data/863342df7/24d3afb77bb149fb94d27aef9efc5e17 [2018-11-28 11:44:19,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:44:19,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:44:19,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:44:19,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:44:19,936 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:44:19,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:19" (1/1) ... [2018-11-28 11:44:19,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775ed1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:19, skipping insertion in model container [2018-11-28 11:44:19,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:19" (1/1) ... [2018-11-28 11:44:19,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:44:19,975 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:44:20,162 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:44:20,167 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:44:20,302 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:44:20,314 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:44:20,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20 WrapperNode [2018-11-28 11:44:20,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:44:20,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:44:20,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:44:20,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:44:20,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:44:20,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:44:20,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:44:20,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:44:20,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... [2018-11-28 11:44:20,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:44:20,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:44:20,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:44:20,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:44:20,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:44:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-28 11:44:20,415 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-28 11:44:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:44:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:44:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-11-28 11:44:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-11-28 11:44:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-28 11:44:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-28 11:44:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-28 11:44:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-28 11:44:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-11-28 11:44:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-11-28 11:44:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-28 11:44:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-28 11:44:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-28 11:44:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-28 11:44:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-28 11:44:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-28 11:44:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-28 11:44:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-28 11:44:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-28 11:44:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-28 11:44:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-11-28 11:44:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-11-28 11:44:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-11-28 11:44:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-11-28 11:44:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-11-28 11:44:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-11-28 11:44:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-11-28 11:44:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-11-28 11:44:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-11-28 11:44:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-11-28 11:44:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-11-28 11:44:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-11-28 11:44:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-11-28 11:44:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-11-28 11:44:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-28 11:44:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-28 11:44:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-11-28 11:44:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-11-28 11:44:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-28 11:44:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-28 11:44:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-11-28 11:44:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-11-28 11:44:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-11-28 11:44:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-11-28 11:44:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-11-28 11:44:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-11-28 11:44:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:44:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:44:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:44:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:44:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-11-28 11:44:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-11-28 11:44:20,595 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:20,596 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:20,730 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:20,731 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:20,773 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:20,773 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:20,788 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:20,789 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:20,919 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:20,919 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:20,985 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:20,985 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:21,030 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:44:21,030 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:44:21,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:21 BoogieIcfgContainer [2018-11-28 11:44:21,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:44:21,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:44:21,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:44:21,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:44:21,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:44:19" (1/3) ... [2018-11-28 11:44:21,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72802050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:44:21, skipping insertion in model container [2018-11-28 11:44:21,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:20" (2/3) ... [2018-11-28 11:44:21,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72802050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:44:21, skipping insertion in model container [2018-11-28 11:44:21,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:21" (3/3) ... [2018-11-28 11:44:21,037 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 11:44:21,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:44:21,052 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:44:21,065 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:44:21,088 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:44:21,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:44:21,089 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:44:21,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:44:21,089 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:44:21,089 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:44:21,089 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:44:21,089 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:44:21,090 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:44:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2018-11-28 11:44:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:44:21,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:21,115 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-11-28 11:44:21,116 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:21,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:21,120 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2018-11-28 11:44:21,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:21,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:21,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:21,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:21,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:21,302 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2018-11-28 11:44:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:21,431 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2018-11-28 11:44:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:21,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 11:44:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:21,443 INFO L225 Difference]: With dead ends: 537 [2018-11-28 11:44:21,443 INFO L226 Difference]: Without dead ends: 287 [2018-11-28 11:44:21,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-28 11:44:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-28 11:44:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-28 11:44:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2018-11-28 11:44:21,500 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2018-11-28 11:44:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:21,500 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2018-11-28 11:44:21,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2018-11-28 11:44:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:44:21,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:21,502 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-11-28 11:44:21,502 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:21,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:21,502 INFO L82 PathProgramCache]: Analyzing trace with hash -415593342, now seen corresponding path program 1 times [2018-11-28 11:44:21,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:21,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:21,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:21,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:21,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:21,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:21,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:21,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:21,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:21,612 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2018-11-28 11:44:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:21,793 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2018-11-28 11:44:21,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:21,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:44:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:21,798 INFO L225 Difference]: With dead ends: 637 [2018-11-28 11:44:21,799 INFO L226 Difference]: Without dead ends: 454 [2018-11-28 11:44:21,801 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-11-28 11:44:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-11-28 11:44:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2018-11-28 11:44:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-28 11:44:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2018-11-28 11:44:21,837 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2018-11-28 11:44:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:21,838 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2018-11-28 11:44:21,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2018-11-28 11:44:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 11:44:21,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:21,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:21,839 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:21,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1358856561, now seen corresponding path program 1 times [2018-11-28 11:44:21,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:21,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:21,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:21,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:21,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:21,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:21,916 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2018-11-28 11:44:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:21,963 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2018-11-28 11:44:21,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:21,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 11:44:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:21,970 INFO L225 Difference]: With dead ends: 963 [2018-11-28 11:44:21,970 INFO L226 Difference]: Without dead ends: 646 [2018-11-28 11:44:21,973 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-11-28 11:44:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-11-28 11:44:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2018-11-28 11:44:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-28 11:44:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2018-11-28 11:44:22,015 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2018-11-28 11:44:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,015 INFO L480 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2018-11-28 11:44:22,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2018-11-28 11:44:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:44:22,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,017 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-11-28 11:44:22,017 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2018-11-28 11:44:22,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:22,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:22,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:22,067 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2018-11-28 11:44:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,192 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2018-11-28 11:44:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:22,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 11:44:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,197 INFO L225 Difference]: With dead ends: 621 [2018-11-28 11:44:22,197 INFO L226 Difference]: Without dead ends: 617 [2018-11-28 11:44:22,197 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-11-28 11:44:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-28 11:44:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2018-11-28 11:44:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-28 11:44:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2018-11-28 11:44:22,230 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2018-11-28 11:44:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,231 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2018-11-28 11:44:22,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2018-11-28 11:44:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 11:44:22,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,233 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-11-28 11:44:22,236 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash 185749717, now seen corresponding path program 1 times [2018-11-28 11:44:22,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:22,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:22,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:22,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:22,280 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2018-11-28 11:44:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,363 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2018-11-28 11:44:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:22,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-28 11:44:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,370 INFO L225 Difference]: With dead ends: 1072 [2018-11-28 11:44:22,370 INFO L226 Difference]: Without dead ends: 1053 [2018-11-28 11:44:22,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2018-11-28 11:44:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2018-11-28 11:44:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-28 11:44:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2018-11-28 11:44:22,416 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2018-11-28 11:44:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,416 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2018-11-28 11:44:22,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2018-11-28 11:44:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 11:44:22,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,417 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-11-28 11:44:22,418 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash 171404808, now seen corresponding path program 1 times [2018-11-28 11:44:22,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:22,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:22,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:22,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:22,458 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2018-11-28 11:44:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,578 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2018-11-28 11:44:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:22,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-28 11:44:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,584 INFO L225 Difference]: With dead ends: 1050 [2018-11-28 11:44:22,584 INFO L226 Difference]: Without dead ends: 1045 [2018-11-28 11:44:22,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-11-28 11:44:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2018-11-28 11:44:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-11-28 11:44:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2018-11-28 11:44:22,626 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2018-11-28 11:44:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,626 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2018-11-28 11:44:22,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2018-11-28 11:44:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:44:22,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,627 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-11-28 11:44:22,627 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1471308180, now seen corresponding path program 1 times [2018-11-28 11:44:22,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:22,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:22,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:22,684 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2018-11-28 11:44:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,735 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2018-11-28 11:44:22,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:22,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-28 11:44:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,741 INFO L225 Difference]: With dead ends: 1058 [2018-11-28 11:44:22,741 INFO L226 Difference]: Without dead ends: 1036 [2018-11-28 11:44:22,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-28 11:44:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2018-11-28 11:44:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-11-28 11:44:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2018-11-28 11:44:22,784 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2018-11-28 11:44:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,785 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2018-11-28 11:44:22,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2018-11-28 11:44:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:44:22,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:22,786 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1601291379, now seen corresponding path program 1 times [2018-11-28 11:44:22,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:22,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:22,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:22,839 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2018-11-28 11:44:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,876 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2018-11-28 11:44:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:22,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-28 11:44:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,881 INFO L225 Difference]: With dead ends: 1448 [2018-11-28 11:44:22,881 INFO L226 Difference]: Without dead ends: 578 [2018-11-28 11:44:22,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-11-28 11:44:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2018-11-28 11:44:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-28 11:44:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2018-11-28 11:44:22,913 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2018-11-28 11:44:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,913 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2018-11-28 11:44:22,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2018-11-28 11:44:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 11:44:22,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,914 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-11-28 11:44:22,914 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2018-11-28 11:44:22,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:22,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:22,961 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 5 states. [2018-11-28 11:44:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:23,172 INFO L93 Difference]: Finished difference Result 586 states and 829 transitions. [2018-11-28 11:44:23,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:23,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-28 11:44:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:23,175 INFO L225 Difference]: With dead ends: 586 [2018-11-28 11:44:23,175 INFO L226 Difference]: Without dead ends: 580 [2018-11-28 11:44:23,176 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-11-28 11:44:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-11-28 11:44:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-11-28 11:44:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-28 11:44:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2018-11-28 11:44:23,193 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2018-11-28 11:44:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:23,193 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2018-11-28 11:44:23,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2018-11-28 11:44:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:44:23,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:23,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:23,194 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:23,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2018-11-28 11:44:23,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:23,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:23,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:23,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:23,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:23,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:23,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:23,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:23,228 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 5 states. [2018-11-28 11:44:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:23,530 INFO L93 Difference]: Finished difference Result 586 states and 828 transitions. [2018-11-28 11:44:23,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:23,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 11:44:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:23,534 INFO L225 Difference]: With dead ends: 586 [2018-11-28 11:44:23,534 INFO L226 Difference]: Without dead ends: 580 [2018-11-28 11:44:23,535 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-11-28 11:44:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-11-28 11:44:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-11-28 11:44:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-28 11:44:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2018-11-28 11:44:23,563 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2018-11-28 11:44:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:23,563 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2018-11-28 11:44:23,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2018-11-28 11:44:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 11:44:23,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:23,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:23,565 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:23,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2018-11-28 11:44:23,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:23,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:23,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:23,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:23,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:23,633 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2018-11-28 11:44:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:23,724 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2018-11-28 11:44:23,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:44:23,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-28 11:44:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:23,727 INFO L225 Difference]: With dead ends: 601 [2018-11-28 11:44:23,727 INFO L226 Difference]: Without dead ends: 576 [2018-11-28 11:44:23,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-11-28 11:44:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2018-11-28 11:44:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-11-28 11:44:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2018-11-28 11:44:23,756 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2018-11-28 11:44:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:23,756 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2018-11-28 11:44:23,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2018-11-28 11:44:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 11:44:23,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:23,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:23,757 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:23,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1921382045, now seen corresponding path program 1 times [2018-11-28 11:44:23,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:23,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:23,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:23,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:23,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:23,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:23,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:23,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:23,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:23,794 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2018-11-28 11:44:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:23,909 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2018-11-28 11:44:23,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:23,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-28 11:44:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:23,913 INFO L225 Difference]: With dead ends: 810 [2018-11-28 11:44:23,913 INFO L226 Difference]: Without dead ends: 802 [2018-11-28 11:44:23,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-11-28 11:44:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2018-11-28 11:44:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-11-28 11:44:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2018-11-28 11:44:23,948 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2018-11-28 11:44:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:23,948 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2018-11-28 11:44:23,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2018-11-28 11:44:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 11:44:23,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:23,949 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-11-28 11:44:23,949 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:23,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash 488507897, now seen corresponding path program 1 times [2018-11-28 11:44:23,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:23,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:23,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:23,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:23,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:23,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:44:23,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:44:23,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:44:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:44:23,993 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2018-11-28 11:44:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:24,134 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2018-11-28 11:44:24,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:44:24,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-28 11:44:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:24,136 INFO L225 Difference]: With dead ends: 719 [2018-11-28 11:44:24,137 INFO L226 Difference]: Without dead ends: 452 [2018-11-28 11:44:24,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:44:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-28 11:44:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2018-11-28 11:44:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-11-28 11:44:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2018-11-28 11:44:24,158 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2018-11-28 11:44:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:24,160 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2018-11-28 11:44:24,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:44:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2018-11-28 11:44:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:44:24,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:24,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:24,161 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:24,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1019702007, now seen corresponding path program 1 times [2018-11-28 11:44:24,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:24,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:24,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:24,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:24,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:24,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:44:24,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:44:24,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:44:24,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:44:24,258 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2018-11-28 11:44:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:24,412 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2018-11-28 11:44:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:44:24,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-28 11:44:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:24,415 INFO L225 Difference]: With dead ends: 447 [2018-11-28 11:44:24,415 INFO L226 Difference]: Without dead ends: 443 [2018-11-28 11:44:24,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:44:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-28 11:44:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-11-28 11:44:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-11-28 11:44:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2018-11-28 11:44:24,438 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2018-11-28 11:44:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:24,438 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2018-11-28 11:44:24,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:44:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2018-11-28 11:44:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:44:24,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:24,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:24,439 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:24,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:24,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1019425177, now seen corresponding path program 1 times [2018-11-28 11:44:24,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:24,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:24,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:24,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:24,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:44:24,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:44:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:44:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:44:24,494 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2018-11-28 11:44:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:24,569 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2018-11-28 11:44:24,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:44:24,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-28 11:44:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:24,572 INFO L225 Difference]: With dead ends: 760 [2018-11-28 11:44:24,572 INFO L226 Difference]: Without dead ends: 462 [2018-11-28 11:44:24,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:44:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-28 11:44:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2018-11-28 11:44:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-28 11:44:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2018-11-28 11:44:24,606 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2018-11-28 11:44:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:24,606 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2018-11-28 11:44:24,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:44:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2018-11-28 11:44:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:44:24,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:24,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:24,607 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:24,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash 56692718, now seen corresponding path program 1 times [2018-11-28 11:44:24,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:24,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:24,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:24,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:24,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:24,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:24,673 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2018-11-28 11:44:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,104 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2018-11-28 11:44:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:25,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 11:44:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,108 INFO L225 Difference]: With dead ends: 580 [2018-11-28 11:44:25,108 INFO L226 Difference]: Without dead ends: 561 [2018-11-28 11:44:25,108 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-11-28 11:44:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-11-28 11:44:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2018-11-28 11:44:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-28 11:44:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2018-11-28 11:44:25,134 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2018-11-28 11:44:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:25,134 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2018-11-28 11:44:25,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2018-11-28 11:44:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 11:44:25,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:25,135 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-11-28 11:44:25,135 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:25,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:25,135 INFO L82 PathProgramCache]: Analyzing trace with hash -420532410, now seen corresponding path program 1 times [2018-11-28 11:44:25,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:25,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:25,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:25,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:44:25,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:44:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:44:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:44:25,184 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2018-11-28 11:44:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,297 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2018-11-28 11:44:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:44:25,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-28 11:44:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,299 INFO L225 Difference]: With dead ends: 448 [2018-11-28 11:44:25,299 INFO L226 Difference]: Without dead ends: 417 [2018-11-28 11:44:25,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:44:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-28 11:44:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-11-28 11:44:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-28 11:44:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-11-28 11:44:25,326 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2018-11-28 11:44:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:25,326 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-11-28 11:44:25,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:44:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-11-28 11:44:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:44:25,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:25,330 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-11-28 11:44:25,330 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:25,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:25,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2018-11-28 11:44:25,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:25,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:25,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:25,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:25,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:25,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:25,378 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2018-11-28 11:44:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,417 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2018-11-28 11:44:25,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:25,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-28 11:44:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,419 INFO L225 Difference]: With dead ends: 432 [2018-11-28 11:44:25,419 INFO L226 Difference]: Without dead ends: 399 [2018-11-28 11:44:25,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-28 11:44:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-11-28 11:44:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-28 11:44:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2018-11-28 11:44:25,440 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2018-11-28 11:44:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:25,440 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2018-11-28 11:44:25,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-11-28 11:44:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:44:25,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:25,441 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-11-28 11:44:25,441 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:25,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2018-11-28 11:44:25,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:25,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:44:25,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:44:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:44:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:44:25,487 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2018-11-28 11:44:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,608 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2018-11-28 11:44:25,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:44:25,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-28 11:44:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,611 INFO L225 Difference]: With dead ends: 429 [2018-11-28 11:44:25,611 INFO L226 Difference]: Without dead ends: 408 [2018-11-28 11:44:25,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:44:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-11-28 11:44:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-11-28 11:44:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-28 11:44:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-11-28 11:44:25,634 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2018-11-28 11:44:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:25,634 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-11-28 11:44:25,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:44:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-11-28 11:44:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:44:25,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:25,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:25,635 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:25,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2018-11-28 11:44:25,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:25,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:44:25,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:44:25,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:44:25,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:44:25,671 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-11-28 11:44:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,706 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-11-28 11:44:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:44:25,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-28 11:44:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,709 INFO L225 Difference]: With dead ends: 436 [2018-11-28 11:44:25,709 INFO L226 Difference]: Without dead ends: 410 [2018-11-28 11:44:25,710 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-11-28 11:44:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-28 11:44:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-11-28 11:44:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-28 11:44:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-11-28 11:44:25,731 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-11-28 11:44:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:25,731 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-11-28 11:44:25,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:44:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-11-28 11:44:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:44:25,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:25,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:25,734 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:25,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2018-11-28 11:44:25,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:25,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:44:25,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:44:25,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:44:25,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:25,810 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-11-28 11:44:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:26,286 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-11-28 11:44:26,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:44:26,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-28 11:44:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:26,289 INFO L225 Difference]: With dead ends: 565 [2018-11-28 11:44:26,289 INFO L226 Difference]: Without dead ends: 511 [2018-11-28 11:44:26,290 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-11-28 11:44:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-28 11:44:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-11-28 11:44:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-28 11:44:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-11-28 11:44:26,321 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-11-28 11:44:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:26,321 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-11-28 11:44:26,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:44:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-11-28 11:44:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:44:26,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:26,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:26,322 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:26,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2018-11-28 11:44:26,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:26,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:26,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:26,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:26,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:26,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:26,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:26,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:26,367 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-11-28 11:44:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:26,468 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-11-28 11:44:26,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:26,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-28 11:44:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:26,471 INFO L225 Difference]: With dead ends: 673 [2018-11-28 11:44:26,472 INFO L226 Difference]: Without dead ends: 659 [2018-11-28 11:44:26,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-28 11:44:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-11-28 11:44:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-11-28 11:44:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-11-28 11:44:26,497 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-11-28 11:44:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:26,497 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-11-28 11:44:26,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-11-28 11:44:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:44:26,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:26,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:26,498 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:26,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:26,498 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2018-11-28 11:44:26,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:26,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:26,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:26,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:44:26,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:44:26,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:44:26,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:44:26,553 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-11-28 11:44:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:26,594 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-11-28 11:44:26,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:44:26,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-28 11:44:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:26,597 INFO L225 Difference]: With dead ends: 598 [2018-11-28 11:44:26,597 INFO L226 Difference]: Without dead ends: 574 [2018-11-28 11:44:26,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:44:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-28 11:44:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-11-28 11:44:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-28 11:44:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-11-28 11:44:26,620 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-11-28 11:44:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:26,621 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-11-28 11:44:26,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:44:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-11-28 11:44:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 11:44:26,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:26,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:26,622 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:26,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2018-11-28 11:44:26,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:26,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:26,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:26,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:26,663 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-11-28 11:44:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:26,947 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-11-28 11:44:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:26,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 11:44:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:26,951 INFO L225 Difference]: With dead ends: 660 [2018-11-28 11:44:26,951 INFO L226 Difference]: Without dead ends: 624 [2018-11-28 11:44:26,952 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-11-28 11:44:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-28 11:44:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-11-28 11:44:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-28 11:44:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-11-28 11:44:26,999 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-11-28 11:44:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,000 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-28 11:44:27,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-11-28 11:44:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 11:44:27,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,001 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-11-28 11:44:27,001 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1927592443, now seen corresponding path program 1 times [2018-11-28 11:44:27,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:27,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:27,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:27,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:27,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:27,074 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-11-28 11:44:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,150 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-11-28 11:44:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:27,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-28 11:44:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,154 INFO L225 Difference]: With dead ends: 955 [2018-11-28 11:44:27,154 INFO L226 Difference]: Without dead ends: 527 [2018-11-28 11:44:27,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-11-28 11:44:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-11-28 11:44:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-28 11:44:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-11-28 11:44:27,190 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-11-28 11:44:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,190 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-11-28 11:44:27,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-11-28 11:44:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 11:44:27,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,191 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1553434371, now seen corresponding path program 1 times [2018-11-28 11:44:27,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:27,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:44:27,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:44:27,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:44:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:44:27,252 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-11-28 11:44:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,389 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-11-28 11:44:27,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:44:27,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-28 11:44:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,393 INFO L225 Difference]: With dead ends: 529 [2018-11-28 11:44:27,393 INFO L226 Difference]: Without dead ends: 466 [2018-11-28 11:44:27,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:44:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-11-28 11:44:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-11-28 11:44:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-28 11:44:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-11-28 11:44:27,425 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-11-28 11:44:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,425 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-11-28 11:44:27,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:44:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-11-28 11:44:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 11:44:27,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,426 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-11-28 11:44:27,426 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1051956534, now seen corresponding path program 1 times [2018-11-28 11:44:27,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:27,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:27,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:27,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:27,466 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-11-28 11:44:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,522 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-11-28 11:44:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:27,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-28 11:44:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,527 INFO L225 Difference]: With dead ends: 918 [2018-11-28 11:44:27,527 INFO L226 Difference]: Without dead ends: 491 [2018-11-28 11:44:27,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-28 11:44:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-11-28 11:44:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-28 11:44:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-11-28 11:44:27,562 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-11-28 11:44:27,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,562 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-11-28 11:44:27,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-11-28 11:44:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 11:44:27,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,563 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1770735671, now seen corresponding path program 1 times [2018-11-28 11:44:27,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:27,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:27,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:27,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:27,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:27,594 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-11-28 11:44:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,690 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-11-28 11:44:27,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:27,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-28 11:44:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,695 INFO L225 Difference]: With dead ends: 730 [2018-11-28 11:44:27,695 INFO L226 Difference]: Without dead ends: 727 [2018-11-28 11:44:27,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-28 11:44:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-11-28 11:44:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-28 11:44:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-11-28 11:44:27,733 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-11-28 11:44:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,733 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-11-28 11:44:27,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-11-28 11:44:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 11:44:27,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,734 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1533013073, now seen corresponding path program 1 times [2018-11-28 11:44:27,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,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-11-28 11:44:27,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:27,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:27,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:27,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:27,870 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 6 states. [2018-11-28 11:44:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,923 INFO L93 Difference]: Finished difference Result 755 states and 1177 transitions. [2018-11-28 11:44:27,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:27,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-28 11:44:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,926 INFO L225 Difference]: With dead ends: 755 [2018-11-28 11:44:27,926 INFO L226 Difference]: Without dead ends: 312 [2018-11-28 11:44:27,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-28 11:44:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-11-28 11:44:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-28 11:44:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 435 transitions. [2018-11-28 11:44:27,953 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 435 transitions. Word has length 65 [2018-11-28 11:44:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,953 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 435 transitions. [2018-11-28 11:44:27,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 435 transitions. [2018-11-28 11:44:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:44:27,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,954 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash -620931734, now seen corresponding path program 1 times [2018-11-28 11:44:27,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:28,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:28,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:28,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:28,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:28,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:28,006 INFO L87 Difference]: Start difference. First operand 312 states and 435 transitions. Second operand 5 states. [2018-11-28 11:44:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:28,303 INFO L93 Difference]: Finished difference Result 579 states and 830 transitions. [2018-11-28 11:44:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:28,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 11:44:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:28,305 INFO L225 Difference]: With dead ends: 579 [2018-11-28 11:44:28,305 INFO L226 Difference]: Without dead ends: 307 [2018-11-28 11:44:28,306 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-11-28 11:44:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-28 11:44:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-28 11:44:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-28 11:44:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-11-28 11:44:28,331 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-11-28 11:44:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:28,331 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-11-28 11:44:28,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-11-28 11:44:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 11:44:28,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:28,332 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-11-28 11:44:28,332 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:28,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash 438765614, now seen corresponding path program 1 times [2018-11-28 11:44:28,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:28,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:28,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:28,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:28,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:28,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:28,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:28,473 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 5 states. [2018-11-28 11:44:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:28,975 INFO L93 Difference]: Finished difference Result 669 states and 953 transitions. [2018-11-28 11:44:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:28,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-28 11:44:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:28,978 INFO L225 Difference]: With dead ends: 669 [2018-11-28 11:44:28,978 INFO L226 Difference]: Without dead ends: 405 [2018-11-28 11:44:28,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:44:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-11-28 11:44:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 363. [2018-11-28 11:44:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-28 11:44:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 503 transitions. [2018-11-28 11:44:29,010 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 503 transitions. Word has length 70 [2018-11-28 11:44:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,011 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 503 transitions. [2018-11-28 11:44:29,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 503 transitions. [2018-11-28 11:44:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 11:44:29,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,011 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-11-28 11:44:29,012 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1587959962, now seen corresponding path program 1 times [2018-11-28 11:44:29,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:29,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:29,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:29,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:29,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:29,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:29,079 INFO L87 Difference]: Start difference. First operand 363 states and 503 transitions. Second operand 6 states. [2018-11-28 11:44:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:29,157 INFO L93 Difference]: Finished difference Result 691 states and 982 transitions. [2018-11-28 11:44:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:29,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-28 11:44:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:29,160 INFO L225 Difference]: With dead ends: 691 [2018-11-28 11:44:29,160 INFO L226 Difference]: Without dead ends: 369 [2018-11-28 11:44:29,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-28 11:44:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-11-28 11:44:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-28 11:44:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 505 transitions. [2018-11-28 11:44:29,194 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 505 transitions. Word has length 72 [2018-11-28 11:44:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,194 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 505 transitions. [2018-11-28 11:44:29,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 505 transitions. [2018-11-28 11:44:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 11:44:29,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,195 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-11-28 11:44:29,196 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1286621045, now seen corresponding path program 1 times [2018-11-28 11:44:29,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:29,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:29,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:29,268 INFO L87 Difference]: Start difference. First operand 366 states and 505 transitions. Second operand 6 states. [2018-11-28 11:44:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:29,537 INFO L93 Difference]: Finished difference Result 642 states and 895 transitions. [2018-11-28 11:44:29,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:44:29,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-28 11:44:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:29,540 INFO L225 Difference]: With dead ends: 642 [2018-11-28 11:44:29,542 INFO L226 Difference]: Without dead ends: 337 [2018-11-28 11:44:29,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-28 11:44:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-11-28 11:44:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-28 11:44:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 441 transitions. [2018-11-28 11:44:29,561 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 441 transitions. Word has length 83 [2018-11-28 11:44:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,561 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 441 transitions. [2018-11-28 11:44:29,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 441 transitions. [2018-11-28 11:44:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 11:44:29,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,562 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-11-28 11:44:29,563 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash -49085271, now seen corresponding path program 1 times [2018-11-28 11:44:29,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:29,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:29,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 11:44:29,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 11:44:29,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 11:44:29,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:44:29,674 INFO L87 Difference]: Start difference. First operand 329 states and 441 transitions. Second operand 15 states. [2018-11-28 11:44:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:29,800 INFO L93 Difference]: Finished difference Result 626 states and 853 transitions. [2018-11-28 11:44:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:44:29,801 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-11-28 11:44:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:29,803 INFO L225 Difference]: With dead ends: 626 [2018-11-28 11:44:29,803 INFO L226 Difference]: Without dead ends: 333 [2018-11-28 11:44:29,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:44:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-28 11:44:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2018-11-28 11:44:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-28 11:44:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 443 transitions. [2018-11-28 11:44:29,823 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 443 transitions. Word has length 92 [2018-11-28 11:44:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,824 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 443 transitions. [2018-11-28 11:44:29,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 11:44:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 443 transitions. [2018-11-28 11:44:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 11:44:29,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:29,825 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310540, now seen corresponding path program 1 times [2018-11-28 11:44:29,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:29,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:29,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 11:44:29,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:44:29,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:44:29,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:44:29,935 INFO L87 Difference]: Start difference. First operand 332 states and 443 transitions. Second operand 14 states. [2018-11-28 11:44:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:30,741 INFO L93 Difference]: Finished difference Result 364 states and 472 transitions. [2018-11-28 11:44:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:44:30,741 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-28 11:44:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:30,742 INFO L225 Difference]: With dead ends: 364 [2018-11-28 11:44:30,743 INFO L226 Difference]: Without dead ends: 322 [2018-11-28 11:44:30,743 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-11-28 11:44:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-28 11:44:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2018-11-28 11:44:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-28 11:44:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 423 transitions. [2018-11-28 11:44:30,758 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 423 transitions. Word has length 103 [2018-11-28 11:44:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:30,759 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 423 transitions. [2018-11-28 11:44:30,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:44:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 423 transitions. [2018-11-28 11:44:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-28 11:44:30,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:30,760 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-11-28 11:44:30,760 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:30,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash -12169486, now seen corresponding path program 1 times [2018-11-28 11:44:30,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:30,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:30,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:30,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 11:44:30,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 11:44:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 11:44:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:44:30,853 INFO L87 Difference]: Start difference. First operand 317 states and 423 transitions. Second operand 15 states. [2018-11-28 11:44:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:30,952 INFO L93 Difference]: Finished difference Result 353 states and 468 transitions. [2018-11-28 11:44:30,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:44:30,952 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-11-28 11:44:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:30,954 INFO L225 Difference]: With dead ends: 353 [2018-11-28 11:44:30,954 INFO L226 Difference]: Without dead ends: 326 [2018-11-28 11:44:30,954 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-11-28 11:44:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-28 11:44:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-11-28 11:44:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-28 11:44:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-11-28 11:44:30,972 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 108 [2018-11-28 11:44:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:30,973 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-11-28 11:44:30,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 11:44:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-11-28 11:44:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-28 11:44:30,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:30,975 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-11-28 11:44:30,975 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:30,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:30,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1168498032, now seen corresponding path program 1 times [2018-11-28 11:44:30,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:30,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:30,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:30,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:44:31,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:31,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:31,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:31,033 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 5 states. [2018-11-28 11:44:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:31,239 INFO L93 Difference]: Finished difference Result 709 states and 929 transitions. [2018-11-28 11:44:31,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:31,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-28 11:44:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:31,241 INFO L225 Difference]: With dead ends: 709 [2018-11-28 11:44:31,241 INFO L226 Difference]: Without dead ends: 447 [2018-11-28 11:44:31,242 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-11-28 11:44:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-28 11:44:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-11-28 11:44:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-28 11:44:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-11-28 11:44:31,262 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 132 [2018-11-28 11:44:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:31,262 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-11-28 11:44:31,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-11-28 11:44:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-28 11:44:31,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:31,263 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-11-28 11:44:31,264 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:31,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash 587949524, now seen corresponding path program 1 times [2018-11-28 11:44:31,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:31,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:31,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:31,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:31,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:31,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 11:44:31,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:44:31,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:44:31,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:44:31,364 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 14 states. [2018-11-28 11:44:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:32,127 INFO L93 Difference]: Finished difference Result 405 states and 514 transitions. [2018-11-28 11:44:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:44:32,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-11-28 11:44:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:32,129 INFO L225 Difference]: With dead ends: 405 [2018-11-28 11:44:32,130 INFO L226 Difference]: Without dead ends: 341 [2018-11-28 11:44:32,130 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-11-28 11:44:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-28 11:44:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 275. [2018-11-28 11:44:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-28 11:44:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2018-11-28 11:44:32,154 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 120 [2018-11-28 11:44:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:32,154 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2018-11-28 11:44:32,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:44:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2018-11-28 11:44:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-28 11:44:32,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:32,155 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-11-28 11:44:32,155 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:32,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2028223534, now seen corresponding path program 1 times [2018-11-28 11:44:32,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:32,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 11:44:32,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:32,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:32,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:32,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:32,242 INFO L87 Difference]: Start difference. First operand 275 states and 333 transitions. Second operand 6 states. [2018-11-28 11:44:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:32,302 INFO L93 Difference]: Finished difference Result 468 states and 592 transitions. [2018-11-28 11:44:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:32,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-28 11:44:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:32,305 INFO L225 Difference]: With dead ends: 468 [2018-11-28 11:44:32,305 INFO L226 Difference]: Without dead ends: 322 [2018-11-28 11:44:32,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-28 11:44:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-11-28 11:44:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-28 11:44:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 320 transitions. [2018-11-28 11:44:32,330 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 320 transitions. Word has length 121 [2018-11-28 11:44:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:32,330 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 320 transitions. [2018-11-28 11:44:32,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 320 transitions. [2018-11-28 11:44:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-28 11:44:32,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:32,331 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-11-28 11:44:32,332 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:32,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:32,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1150164970, now seen corresponding path program 1 times [2018-11-28 11:44:32,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:32,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:32,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:32,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-28 11:44:32,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:44:32,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:44:32,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:32,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:44:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-28 11:44:32,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:44:32,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-28 11:44:32,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:44:32,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:44:32,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:32,675 INFO L87 Difference]: Start difference. First operand 269 states and 320 transitions. Second operand 7 states. [2018-11-28 11:44:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:32,747 INFO L93 Difference]: Finished difference Result 425 states and 518 transitions. [2018-11-28 11:44:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:44:32,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2018-11-28 11:44:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:32,749 INFO L225 Difference]: With dead ends: 425 [2018-11-28 11:44:32,749 INFO L226 Difference]: Without dead ends: 279 [2018-11-28 11:44:32,749 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-11-28 11:44:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-28 11:44:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-11-28 11:44:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-28 11:44:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2018-11-28 11:44:32,776 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 163 [2018-11-28 11:44:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:32,776 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2018-11-28 11:44:32,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:44:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-11-28 11:44:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-28 11:44:32,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:32,778 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-11-28 11:44:32,778 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:32,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:32,778 INFO L82 PathProgramCache]: Analyzing trace with hash -974469450, now seen corresponding path program 1 times [2018-11-28 11:44:32,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:32,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-28 11:44:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:32,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:32,885 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand 6 states. [2018-11-28 11:44:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:32,952 INFO L93 Difference]: Finished difference Result 435 states and 525 transitions. [2018-11-28 11:44:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:32,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-28 11:44:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:32,955 INFO L225 Difference]: With dead ends: 435 [2018-11-28 11:44:32,955 INFO L226 Difference]: Without dead ends: 303 [2018-11-28 11:44:32,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-28 11:44:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2018-11-28 11:44:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-28 11:44:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 316 transitions. [2018-11-28 11:44:32,985 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 316 transitions. Word has length 164 [2018-11-28 11:44:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:32,986 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 316 transitions. [2018-11-28 11:44:32,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 316 transitions. [2018-11-28 11:44:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-28 11:44:32,990 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:32,991 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-11-28 11:44:32,991 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:32,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:32,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1046099915, now seen corresponding path program 1 times [2018-11-28 11:44:32,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:32,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-28 11:44:33,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:33,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:33,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:33,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:33,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:33,070 INFO L87 Difference]: Start difference. First operand 270 states and 316 transitions. Second operand 6 states. [2018-11-28 11:44:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:33,125 INFO L93 Difference]: Finished difference Result 326 states and 379 transitions. [2018-11-28 11:44:33,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:33,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-11-28 11:44:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:33,126 INFO L225 Difference]: With dead ends: 326 [2018-11-28 11:44:33,126 INFO L226 Difference]: Without dead ends: 255 [2018-11-28 11:44:33,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-28 11:44:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2018-11-28 11:44:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-28 11:44:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 280 transitions. [2018-11-28 11:44:33,147 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 280 transitions. Word has length 204 [2018-11-28 11:44:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:33,147 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 280 transitions. [2018-11-28 11:44:33,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 280 transitions. [2018-11-28 11:44:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-28 11:44:33,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:33,149 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-11-28 11:44:33,149 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:33,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1129206307, now seen corresponding path program 1 times [2018-11-28 11:44:33,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:33,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:33,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-28 11:44:33,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:33,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:33,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:33,233 INFO L87 Difference]: Start difference. First operand 241 states and 280 transitions. Second operand 6 states. [2018-11-28 11:44:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:33,269 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2018-11-28 11:44:33,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:33,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-11-28 11:44:33,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:33,270 INFO L225 Difference]: With dead ends: 241 [2018-11-28 11:44:33,270 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:44:33,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:44:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:44:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:44:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:44:33,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-11-28 11:44:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:33,272 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:44:33,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:44:33,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:44:33,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:44:33,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:33,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:34,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:44:35,008 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-11-28 11:44:35,178 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-11-28 11:44:35,830 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-11-28 11:44:36,252 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-11-28 11:44:36,471 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2018-11-28 11:44:37,223 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-11-28 11:44:37,473 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-11-28 11:44:37,680 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2018-11-28 11:44:37,954 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-11-28 11:44:38,172 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2018-11-28 11:44:38,454 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2018-11-28 11:44:38,833 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-11-28 11:44:39,100 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-28 11:44:39,372 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-11-28 11:44:39,553 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-28 11:44:39,700 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-11-28 11:44:39,835 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2018-11-28 11:44:40,457 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-11-28 11:44:40,521 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-11-28 11:44:40,521 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-11-28 11:44:40,521 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-11-28 11:44:40,521 INFO L451 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-11-28 11:44:40,521 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-11-28 11:44:40,522 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-11-28 11:44:40,522 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-11-28 11:44:40,522 INFO L448 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-11-28 11:44:40,522 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-11-28 11:44:40,522 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-11-28 11:44:40,522 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-11-28 11:44:40,523 INFO L448 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-11-28 11:44:40,523 INFO L448 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-11-28 11:44:40,523 INFO L448 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-11-28 11:44:40,523 INFO L448 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-11-28 11:44:40,523 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-11-28 11:44:40,523 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-11-28 11:44:40,523 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-11-28 11:44:40,523 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-11-28 11:44:40,523 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-11-28 11:44:40,523 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-11-28 11:44:40,524 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-11-28 11:44:40,524 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-11-28 11:44:40,524 INFO L448 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-11-28 11:44:40,524 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-11-28 11:44:40,524 INFO L448 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-11-28 11:44:40,524 INFO L448 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-11-28 11:44:40,524 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-11-28 11:44:40,524 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-11-28 11:44:40,524 INFO L448 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-11-28 11:44:40,524 INFO L448 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-11-28 11:44:40,525 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-11-28 11:44:40,525 INFO L448 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-11-28 11:44:40,525 INFO L448 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-11-28 11:44:40,525 INFO L448 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-11-28 11:44:40,525 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-11-28 11:44:40,525 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-11-28 11:44:40,525 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-11-28 11:44:40,525 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-11-28 11:44:40,525 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-11-28 11:44:40,525 INFO L448 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-11-28 11:44:40,525 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-11-28 11:44:40,525 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-11-28 11:44:40,525 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-11-28 11:44:40,525 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-11-28 11:44:40,526 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-11-28 11:44:40,526 INFO L448 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-11-28 11:44:40,526 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-11-28 11:44:40,526 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-11-28 11:44:40,526 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-11-28 11:44:40,526 INFO L451 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-11-28 11:44:40,526 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-11-28 11:44:40,526 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-11-28 11:44:40,526 INFO L448 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-11-28 11:44:40,527 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-11-28 11:44:40,527 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-11-28 11:44:40,527 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-11-28 11:44:40,527 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-11-28 11:44:40,527 INFO L448 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-11-28 11:44:40,527 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-11-28 11:44:40,527 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-11-28 11:44:40,527 INFO L448 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-11-28 11:44:40,527 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-11-28 11:44:40,527 INFO L448 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-11-28 11:44:40,528 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-11-28 11:44:40,528 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-11-28 11:44:40,528 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-11-28 11:44:40,528 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-11-28 11:44:40,528 INFO L448 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-11-28 11:44:40,528 INFO L448 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-11-28 11:44:40,528 INFO L448 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-11-28 11:44:40,528 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-11-28 11:44:40,528 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-11-28 11:44:40,528 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-11-28 11:44:40,528 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-11-28 11:44:40,529 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-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-11-28 11:44:40,529 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-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-11-28 11:44:40,529 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-11-28 11:44:40,529 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-11-28 11:44:40,530 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-11-28 11:44:40,530 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-11-28 11:44:40,530 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-11-28 11:44:40,530 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-28 11:44:40,530 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-11-28 11:44:40,530 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-11-28 11:44:40,530 INFO L448 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-11-28 11:44:40,530 INFO L448 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-11-28 11:44:40,530 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-11-28 11:44:40,530 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-11-28 11:44:40,530 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-11-28 11:44:40,531 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-11-28 11:44:40,531 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-11-28 11:44:40,531 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-11-28 11:44:40,531 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-11-28 11:44:40,531 INFO L448 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-11-28 11:44:40,531 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-11-28 11:44:40,531 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-11-28 11:44:40,532 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-11-28 11:44:40,532 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-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-11-28 11:44:40,532 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-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-28 11:44:40,532 INFO L451 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2018-11-28 11:44:40,532 INFO L451 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2018-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-11-28 11:44:40,532 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-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-11-28 11:44:40,532 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-11-28 11:44:40,532 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-11-28 11:44:40,532 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-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-11-28 11:44:40,533 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-11-28 11:44:40,533 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-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-11-28 11:44:40,533 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-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-11-28 11:44:40,533 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-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-28 11:44:40,533 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-11-28 11:44:40,533 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-11-28 11:44:40,534 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-11-28 11:44:40,534 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-11-28 11:44:40,534 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-11-28 11:44:40,534 INFO L448 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-11-28 11:44:40,534 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-28 11:44:40,534 INFO L448 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-11-28 11:44:40,534 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-11-28 11:44:40,534 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-11-28 11:44:40,534 INFO L448 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-11-28 11:44:40,534 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-11-28 11:44:40,535 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-11-28 11:44:40,535 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-11-28 11:44:40,535 INFO L448 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-11-28 11:44:40,535 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-11-28 11:44:40,535 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-11-28 11:44:40,535 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-11-28 11:44:40,535 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-11-28 11:44:40,535 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-28 11:44:40,535 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-11-28 11:44:40,536 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-11-28 11:44:40,536 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-11-28 11:44:40,536 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-11-28 11:44:40,536 INFO L448 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-11-28 11:44:40,536 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-11-28 11:44:40,536 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-11-28 11:44:40,536 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-11-28 11:44:40,536 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-11-28 11:44:40,536 INFO L448 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-11-28 11:44:40,536 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-11-28 11:44:40,536 INFO L448 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-11-28 11:44:40,537 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-11-28 11:44:40,537 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-11-28 11:44:40,537 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-11-28 11:44:40,537 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-11-28 11:44:40,537 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-11-28 11:44:40,537 INFO L448 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-11-28 11:44:40,537 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-11-28 11:44:40,537 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-11-28 11:44:40,537 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-11-28 11:44:40,537 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-28 11:44:40,538 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-11-28 11:44:40,538 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-11-28 11:44:40,538 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-11-28 11:44:40,538 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-11-28 11:44:40,538 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-11-28 11:44:40,538 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-11-28 11:44:40,538 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-28 11:44:40,538 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-11-28 11:44:40,538 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-11-28 11:44:40,539 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-11-28 11:44:40,539 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-11-28 11:44:40,539 INFO L448 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-11-28 11:44:40,539 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-11-28 11:44:40,539 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-11-28 11:44:40,539 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-11-28 11:44:40,539 INFO L448 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-11-28 11:44:40,539 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-28 11:44:40,540 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-11-28 11:44:40,540 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-11-28 11:44:40,540 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-11-28 11:44:40,540 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-11-28 11:44:40,540 INFO L448 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-11-28 11:44:40,540 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-11-28 11:44:40,540 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-11-28 11:44:40,540 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-11-28 11:44:40,541 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-11-28 11:44:40,541 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-11-28 11:44:40,541 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-11-28 11:44:40,541 INFO L448 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-11-28 11:44:40,541 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-11-28 11:44:40,541 INFO L448 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-11-28 11:44:40,541 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-11-28 11:44:40,541 INFO L448 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-11-28 11:44:40,541 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-11-28 11:44:40,541 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-11-28 11:44:40,542 INFO L448 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-11-28 11:44:40,542 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-11-28 11:44:40,542 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-11-28 11:44:40,542 INFO L448 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-11-28 11:44:40,542 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-11-28 11:44:40,542 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-11-28 11:44:40,542 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-11-28 11:44:40,542 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-11-28 11:44:40,542 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-11-28 11:44:40,542 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-28 11:44:40,542 INFO L448 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-11-28 11:44:40,543 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-11-28 11:44:40,543 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-11-28 11:44:40,543 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-11-28 11:44:40,543 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-11-28 11:44:40,543 INFO L448 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-11-28 11:44:40,543 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-11-28 11:44:40,543 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-11-28 11:44:40,543 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-11-28 11:44:40,543 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-11-28 11:44:40,544 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-11-28 11:44:40,544 INFO L451 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-11-28 11:44:40,544 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-11-28 11:44:40,544 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-11-28 11:44:40,544 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-11-28 11:44:40,544 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-11-28 11:44:40,544 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-11-28 11:44:40,544 INFO L448 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-11-28 11:44:40,545 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-11-28 11:44:40,545 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-11-28 11:44:40,545 INFO L448 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-11-28 11:44:40,545 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-11-28 11:44:40,545 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-11-28 11:44:40,545 INFO L448 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-11-28 11:44:40,545 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-11-28 11:44:40,545 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-11-28 11:44:40,546 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-11-28 11:44:40,546 INFO L448 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-11-28 11:44:40,546 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-11-28 11:44:40,546 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-11-28 11:44:40,548 INFO L448 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-11-28 11:44:40,548 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-11-28 11:44:40,548 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-11-28 11:44:40,548 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-11-28 11:44:40,548 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-11-28 11:44:40,549 INFO L448 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-11-28 11:44:40,549 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-11-28 11:44:40,549 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-11-28 11:44:40,549 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-11-28 11:44:40,549 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-11-28 11:44:40,549 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-11-28 11:44:40,549 INFO L451 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L451 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L451 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-11-28 11:44:40,555 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-11-28 11:44:40,556 INFO L451 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-11-28 11:44:40,556 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-11-28 11:44:40,556 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-11-28 11:44:40,556 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-11-28 11:44:40,556 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-28 11:44:40,556 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-11-28 11:44:40,556 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-28 11:44:40,556 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-11-28 11:44:40,556 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-28 11:44:40,556 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-11-28 11:44:40,563 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-11-28 11:44:40,564 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-11-28 11:44:40,564 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-11-28 11:44:40,564 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-11-28 11:44:40,564 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-11-28 11:44:40,564 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-11-28 11:44:40,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:44:40,564 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-11-28 11:44:40,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:44:40,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:44:40,565 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-11-28 11:44:40,565 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:44:40,565 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:44:40,565 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-11-28 11:44:40,572 INFO L448 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-11-28 11:44:40,572 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-11-28 11:44:40,572 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-11-28 11:44:40,572 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-11-28 11:44:40,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:44:40 BoogieIcfgContainer [2018-11-28 11:44:40,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:44:40,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:44:40,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:44:40,628 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:44:40,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:21" (3/4) ... [2018-11-28 11:44:40,632 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-28 11:44:40,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-11-28 11:44:40,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-11-28 11:44:40,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:44:40,644 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-11-28 11:44:40,656 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2018-11-28 11:44:40,658 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-11-28 11:44:40,658 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 11:44:40,659 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:44:40,685 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-11-28 11:44:40,686 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-11-28 11:44:40,686 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-11-28 11:44:40,687 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-11-28 11:44:40,687 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-11-28 11:44:40,688 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-11-28 11:44:40,688 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-11-28 11:44:40,688 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-11-28 11:44:40,688 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-11-28 11:44:40,688 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-11-28 11:44:40,689 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-11-28 11:44:40,689 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-11-28 11:44:40,689 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-11-28 11:44:40,690 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-11-28 11:44:40,690 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-11-28 11:44:40,690 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-11-28 11:44:40,690 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-11-28 11:44:40,690 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-11-28 11:44:40,691 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-11-28 11:44:40,691 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-11-28 11:44:40,692 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-11-28 11:44:40,692 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-11-28 11:44:40,692 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-11-28 11:44:40,693 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-11-28 11:44:40,693 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-11-28 11:44:40,694 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-11-28 11:44:40,695 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-11-28 11:44:40,794 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_45196494-0ff7-4452-be9b-93588f465e67/bin-2019/uautomizer/witness.graphml [2018-11-28 11:44:40,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:44:40,795 INFO L168 Benchmark]: Toolchain (without parser) took 20863.43 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 530.6 MB). Free memory was 949.6 MB in the beginning and 1.2 GB in the end (delta: -258.2 MB). Peak memory consumption was 272.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:40,796 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:44:40,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:40,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.13 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:40,797 INFO L168 Benchmark]: Boogie Preprocessor took 36.32 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:40,798 INFO L168 Benchmark]: RCFGBuilder took 658.75 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: 85.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:40,798 INFO L168 Benchmark]: TraceAbstraction took 19596.33 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 393.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -196.8 MB). Peak memory consumption was 538.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:40,798 INFO L168 Benchmark]: Witness Printer took 166.48 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:40,800 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.13 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.32 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 658.75 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: 85.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19596.33 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 393.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -196.8 MB). Peak memory consumption was 538.0 MB. Max. memory is 11.5 GB. * Witness Printer took 166.48 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 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, 19.4s OverallTime, 43 OverallIterations, 4 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 7.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 12826 SDtfs, 6670 SDslu, 33748 SDs, 0 SdLazy, 8353 SolverSat, 1297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 268 SyntacticMatches, 10 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.8s 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: 1.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 1145 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4255 PreInvPairs, 4466 NumberOfFragments, 8314 HoareAnnotationTreeSize, 4255 FomulaSimplifications, 30209 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 109 FomulaSimplificationsInter, 26900 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s 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...