./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/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 d647228c0dc0174eb229424fd194f0e34ba347e1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:39:59,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:39:59,614 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:39:59,621 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:39:59,621 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:39:59,622 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:39:59,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:39:59,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:39:59,625 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:39:59,625 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:39:59,626 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:39:59,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:39:59,627 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:39:59,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:39:59,628 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:39:59,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:39:59,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:39:59,631 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:39:59,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:39:59,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:39:59,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:39:59,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:39:59,636 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:39:59,636 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:39:59,636 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:39:59,637 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:39:59,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:39:59,638 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:39:59,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:39:59,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:39:59,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:39:59,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:39:59,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:39:59,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:39:59,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:39:59,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:39:59,642 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 11:39:59,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:39:59,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:39:59,652 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:39:59,653 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 11:39:59,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:39:59,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:39:59,653 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:39:59,653 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:39:59,653 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:39:59,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:39:59,654 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:39:59,655 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:39:59,655 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:39:59,655 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:39:59,655 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:39:59,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:39:59,655 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:39:59,655 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:39:59,655 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:39:59,656 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:39:59,656 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:39:59,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:39:59,656 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_39a570e7-ecdd-4502-aac5-ffce3dca10af/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 -> d647228c0dc0174eb229424fd194f0e34ba347e1 [2018-11-18 11:39:59,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:39:59,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:39:59,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:39:59,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:39:59,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:39:59,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 11:39:59,742 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/data/532a78b2d/4247632fe7a0447385a043c89a597280/FLAGb27420b59 [2018-11-18 11:40:00,211 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:40:00,212 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 11:40:00,224 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/data/532a78b2d/4247632fe7a0447385a043c89a597280/FLAGb27420b59 [2018-11-18 11:40:00,717 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/data/532a78b2d/4247632fe7a0447385a043c89a597280 [2018-11-18 11:40:00,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:40:00,720 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 11:40:00,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:40:00,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:40:00,723 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:40:00,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:40:00" (1/1) ... [2018-11-18 11:40:00,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf57369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:00, skipping insertion in model container [2018-11-18 11:40:00,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:40:00" (1/1) ... [2018-11-18 11:40:00,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:40:00,785 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:40:01,061 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:40:01,065 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:40:01,210 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:40:01,224 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:40:01,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01 WrapperNode [2018-11-18 11:40:01,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:40:01,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:40:01,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:40:01,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:40:01,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (1/1) ... [2018-11-18 11:40:01,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (1/1) ... [2018-11-18 11:40:01,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (1/1) ... [2018-11-18 11:40:01,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (1/1) ... [2018-11-18 11:40:01,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (1/1) ... [2018-11-18 11:40:01,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (1/1) ... [2018-11-18 11:40:01,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (1/1) ... [2018-11-18 11:40:01,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:40:01,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:40:01,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:40:01,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:40:01,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/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-18 11:40:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-18 11:40:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 11:40:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:40:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 11:40:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 11:40:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 11:40:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 11:40:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 11:40:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 11:40:01,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-18 11:40:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-18 11:40:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-18 11:40:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-18 11:40:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-18 11:40:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 11:40:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 11:40:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 11:40:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 11:40:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-18 11:40:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 11:40:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 11:40:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 11:40:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-18 11:40:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-18 11:40:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 11:40:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:40:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 11:40:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:40:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:40:01,697 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:01,697 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:01,789 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:01,789 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:01,845 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:01,845 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:01,916 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:01,916 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:01,964 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:01,964 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:02,154 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:02,154 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:02,188 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:02,189 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:02,207 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:02,207 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:02,401 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:40:02,401 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:40:02,415 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:40:02,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:40:02 BoogieIcfgContainer [2018-11-18 11:40:02,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:40:02,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:40:02,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:40:02,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:40:02,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:40:00" (1/3) ... [2018-11-18 11:40:02,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0ebbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:40:02, skipping insertion in model container [2018-11-18 11:40:02,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:40:01" (2/3) ... [2018-11-18 11:40:02,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0ebbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:40:02, skipping insertion in model container [2018-11-18 11:40:02,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:40:02" (3/3) ... [2018-11-18 11:40:02,422 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 11:40:02,431 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:40:02,438 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:40:02,449 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:40:02,475 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:40:02,476 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:40:02,476 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:40:02,476 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:40:02,476 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:40:02,477 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:40:02,477 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:40:02,477 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:40:02,477 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:40:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states. [2018-11-18 11:40:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:40:02,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:02,508 INFO L375 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-18 11:40:02,510 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:02,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash -545325625, now seen corresponding path program 1 times [2018-11-18 11:40:02,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:02,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:02,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:02,688 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-18 11:40:02,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:02,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:02,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:02,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:02,710 INFO L87 Difference]: Start difference. First operand 516 states. Second operand 3 states. [2018-11-18 11:40:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:02,949 INFO L93 Difference]: Finished difference Result 889 states and 1375 transitions. [2018-11-18 11:40:02,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:02,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 11:40:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:02,966 INFO L225 Difference]: With dead ends: 889 [2018-11-18 11:40:02,967 INFO L226 Difference]: Without dead ends: 508 [2018-11-18 11:40:02,973 INFO L604 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-18 11:40:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-11-18 11:40:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-11-18 11:40:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-18 11:40:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 738 transitions. [2018-11-18 11:40:03,049 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 738 transitions. Word has length 20 [2018-11-18 11:40:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:03,049 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 738 transitions. [2018-11-18 11:40:03,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 738 transitions. [2018-11-18 11:40:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:40:03,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:03,051 INFO L375 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-18 11:40:03,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:03,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:03,052 INFO L82 PathProgramCache]: Analyzing trace with hash 736354971, now seen corresponding path program 1 times [2018-11-18 11:40:03,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:03,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:03,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:03,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:03,173 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-18 11:40:03,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:03,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:03,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:03,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:03,176 INFO L87 Difference]: Start difference. First operand 508 states and 738 transitions. Second operand 3 states. [2018-11-18 11:40:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:03,407 INFO L93 Difference]: Finished difference Result 792 states and 1120 transitions. [2018-11-18 11:40:03,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:03,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:40:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:03,413 INFO L225 Difference]: With dead ends: 792 [2018-11-18 11:40:03,413 INFO L226 Difference]: Without dead ends: 672 [2018-11-18 11:40:03,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-11-18 11:40:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 654. [2018-11-18 11:40:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-11-18 11:40:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 933 transitions. [2018-11-18 11:40:03,466 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 933 transitions. Word has length 25 [2018-11-18 11:40:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:03,466 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 933 transitions. [2018-11-18 11:40:03,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 933 transitions. [2018-11-18 11:40:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:40:03,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:03,468 INFO L375 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] [2018-11-18 11:40:03,468 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:03,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:03,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1750587816, now seen corresponding path program 1 times [2018-11-18 11:40:03,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:03,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:03,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:03,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:03,530 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-18 11:40:03,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:03,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:03,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:03,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:03,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:03,531 INFO L87 Difference]: Start difference. First operand 654 states and 933 transitions. Second operand 3 states. [2018-11-18 11:40:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:03,587 INFO L93 Difference]: Finished difference Result 999 states and 1382 transitions. [2018-11-18 11:40:03,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:03,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:40:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:03,592 INFO L225 Difference]: With dead ends: 999 [2018-11-18 11:40:03,592 INFO L226 Difference]: Without dead ends: 823 [2018-11-18 11:40:03,593 INFO L604 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-18 11:40:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-11-18 11:40:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 771. [2018-11-18 11:40:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-11-18 11:40:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1095 transitions. [2018-11-18 11:40:03,626 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1095 transitions. Word has length 30 [2018-11-18 11:40:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:03,626 INFO L480 AbstractCegarLoop]: Abstraction has 771 states and 1095 transitions. [2018-11-18 11:40:03,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1095 transitions. [2018-11-18 11:40:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:40:03,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:03,628 INFO L375 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-18 11:40:03,629 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:03,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1290288367, now seen corresponding path program 1 times [2018-11-18 11:40:03,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:03,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:03,666 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-18 11:40:03,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:03,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:03,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:03,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:03,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:03,667 INFO L87 Difference]: Start difference. First operand 771 states and 1095 transitions. Second operand 3 states. [2018-11-18 11:40:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:03,853 INFO L93 Difference]: Finished difference Result 1436 states and 2104 transitions. [2018-11-18 11:40:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:03,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:40:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:03,860 INFO L225 Difference]: With dead ends: 1436 [2018-11-18 11:40:03,860 INFO L226 Difference]: Without dead ends: 1168 [2018-11-18 11:40:03,863 INFO L604 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-18 11:40:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-11-18 11:40:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 907. [2018-11-18 11:40:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-18 11:40:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1331 transitions. [2018-11-18 11:40:03,915 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1331 transitions. Word has length 31 [2018-11-18 11:40:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:03,915 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1331 transitions. [2018-11-18 11:40:03,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1331 transitions. [2018-11-18 11:40:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:40:03,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:03,917 INFO L375 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] [2018-11-18 11:40:03,917 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:03,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:03,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1105841973, now seen corresponding path program 1 times [2018-11-18 11:40:03,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:03,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:03,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:03,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:03,970 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-18 11:40:03,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:03,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:03,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:03,972 INFO L87 Difference]: Start difference. First operand 907 states and 1331 transitions. Second operand 5 states. [2018-11-18 11:40:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:04,597 INFO L93 Difference]: Finished difference Result 1574 states and 2317 transitions. [2018-11-18 11:40:04,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:04,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-18 11:40:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:04,602 INFO L225 Difference]: With dead ends: 1574 [2018-11-18 11:40:04,602 INFO L226 Difference]: Without dead ends: 992 [2018-11-18 11:40:04,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:40:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-18 11:40:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 895. [2018-11-18 11:40:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-18 11:40:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1307 transitions. [2018-11-18 11:40:04,652 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1307 transitions. Word has length 32 [2018-11-18 11:40:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:04,652 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1307 transitions. [2018-11-18 11:40:04,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1307 transitions. [2018-11-18 11:40:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 11:40:04,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:04,654 INFO L375 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-18 11:40:04,654 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:04,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1683321273, now seen corresponding path program 1 times [2018-11-18 11:40:04,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:04,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:04,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:04,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:04,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:04,744 INFO L87 Difference]: Start difference. First operand 895 states and 1307 transitions. Second operand 3 states. [2018-11-18 11:40:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:04,827 INFO L93 Difference]: Finished difference Result 898 states and 1309 transitions. [2018-11-18 11:40:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:04,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 11:40:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:04,832 INFO L225 Difference]: With dead ends: 898 [2018-11-18 11:40:04,832 INFO L226 Difference]: Without dead ends: 894 [2018-11-18 11:40:04,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-11-18 11:40:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2018-11-18 11:40:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-18 11:40:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1304 transitions. [2018-11-18 11:40:04,874 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1304 transitions. Word has length 36 [2018-11-18 11:40:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:04,874 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1304 transitions. [2018-11-18 11:40:04,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1304 transitions. [2018-11-18 11:40:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 11:40:04,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:04,876 INFO L375 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-18 11:40:04,876 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:04,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2048377982, now seen corresponding path program 1 times [2018-11-18 11:40:04,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:04,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:04,910 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-18 11:40:04,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:04,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:04,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:04,911 INFO L87 Difference]: Start difference. First operand 894 states and 1304 transitions. Second operand 3 states. [2018-11-18 11:40:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:04,958 INFO L93 Difference]: Finished difference Result 1286 states and 1827 transitions. [2018-11-18 11:40:04,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:04,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 11:40:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:04,963 INFO L225 Difference]: With dead ends: 1286 [2018-11-18 11:40:04,963 INFO L226 Difference]: Without dead ends: 1023 [2018-11-18 11:40:04,964 INFO L604 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-18 11:40:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-11-18 11:40:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 880. [2018-11-18 11:40:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-18 11:40:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1246 transitions. [2018-11-18 11:40:05,007 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1246 transitions. Word has length 39 [2018-11-18 11:40:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:05,007 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 1246 transitions. [2018-11-18 11:40:05,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1246 transitions. [2018-11-18 11:40:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:40:05,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:05,009 INFO L375 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-18 11:40:05,009 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:05,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1893485112, now seen corresponding path program 1 times [2018-11-18 11:40:05,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:05,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:05,046 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-18 11:40:05,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:05,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:05,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:05,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:05,047 INFO L87 Difference]: Start difference. First operand 880 states and 1246 transitions. Second operand 3 states. [2018-11-18 11:40:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:05,098 INFO L93 Difference]: Finished difference Result 980 states and 1370 transitions. [2018-11-18 11:40:05,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:05,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 11:40:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:05,102 INFO L225 Difference]: With dead ends: 980 [2018-11-18 11:40:05,102 INFO L226 Difference]: Without dead ends: 962 [2018-11-18 11:40:05,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-11-18 11:40:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 900. [2018-11-18 11:40:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-18 11:40:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1272 transitions. [2018-11-18 11:40:05,147 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1272 transitions. Word has length 40 [2018-11-18 11:40:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:05,148 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1272 transitions. [2018-11-18 11:40:05,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1272 transitions. [2018-11-18 11:40:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 11:40:05,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:05,150 INFO L375 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-18 11:40:05,150 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:05,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1084160267, now seen corresponding path program 1 times [2018-11-18 11:40:05,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:05,187 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-18 11:40:05,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:05,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:05,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:05,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:05,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:05,188 INFO L87 Difference]: Start difference. First operand 900 states and 1272 transitions. Second operand 3 states. [2018-11-18 11:40:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:05,236 INFO L93 Difference]: Finished difference Result 1179 states and 1651 transitions. [2018-11-18 11:40:05,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:05,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 11:40:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:05,241 INFO L225 Difference]: With dead ends: 1179 [2018-11-18 11:40:05,241 INFO L226 Difference]: Without dead ends: 933 [2018-11-18 11:40:05,242 INFO L604 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-18 11:40:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-11-18 11:40:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2018-11-18 11:40:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-18 11:40:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1271 transitions. [2018-11-18 11:40:05,286 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1271 transitions. Word has length 46 [2018-11-18 11:40:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:05,286 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1271 transitions. [2018-11-18 11:40:05,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1271 transitions. [2018-11-18 11:40:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 11:40:05,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:05,289 INFO L375 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-18 11:40:05,289 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:05,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:05,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2092414536, now seen corresponding path program 1 times [2018-11-18 11:40:05,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:05,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:05,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:05,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:05,325 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-18 11:40:05,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:05,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:40:05,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:40:05,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:40:05,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:40:05,326 INFO L87 Difference]: Start difference. First operand 900 states and 1271 transitions. Second operand 4 states. [2018-11-18 11:40:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:05,618 INFO L93 Difference]: Finished difference Result 1022 states and 1417 transitions. [2018-11-18 11:40:05,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:40:05,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-18 11:40:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:05,622 INFO L225 Difference]: With dead ends: 1022 [2018-11-18 11:40:05,622 INFO L226 Difference]: Without dead ends: 789 [2018-11-18 11:40:05,623 INFO L604 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-18 11:40:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-11-18 11:40:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 755. [2018-11-18 11:40:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-11-18 11:40:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1060 transitions. [2018-11-18 11:40:05,661 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1060 transitions. Word has length 47 [2018-11-18 11:40:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:05,661 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1060 transitions. [2018-11-18 11:40:05,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:40:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1060 transitions. [2018-11-18 11:40:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 11:40:05,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:05,663 INFO L375 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-18 11:40:05,663 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:05,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash -95752597, now seen corresponding path program 1 times [2018-11-18 11:40:05,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:05,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:05,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:05,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:05,716 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-18 11:40:05,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:05,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:05,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:05,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:05,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:05,717 INFO L87 Difference]: Start difference. First operand 755 states and 1060 transitions. Second operand 3 states. [2018-11-18 11:40:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:05,762 INFO L93 Difference]: Finished difference Result 875 states and 1208 transitions. [2018-11-18 11:40:05,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:05,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 11:40:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:05,765 INFO L225 Difference]: With dead ends: 875 [2018-11-18 11:40:05,766 INFO L226 Difference]: Without dead ends: 779 [2018-11-18 11:40:05,766 INFO L604 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-18 11:40:05,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-18 11:40:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 754. [2018-11-18 11:40:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-18 11:40:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1055 transitions. [2018-11-18 11:40:05,829 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1055 transitions. Word has length 47 [2018-11-18 11:40:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:05,830 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 1055 transitions. [2018-11-18 11:40:05,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1055 transitions. [2018-11-18 11:40:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 11:40:05,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:05,832 INFO L375 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-18 11:40:05,832 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:05,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:05,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1151602405, now seen corresponding path program 1 times [2018-11-18 11:40:05,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:05,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:05,860 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-18 11:40:05,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:05,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:05,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:05,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:05,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:05,861 INFO L87 Difference]: Start difference. First operand 754 states and 1055 transitions. Second operand 3 states. [2018-11-18 11:40:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:05,952 INFO L93 Difference]: Finished difference Result 944 states and 1304 transitions. [2018-11-18 11:40:05,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:05,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 11:40:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:05,956 INFO L225 Difference]: With dead ends: 944 [2018-11-18 11:40:05,956 INFO L226 Difference]: Without dead ends: 934 [2018-11-18 11:40:05,958 INFO L604 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-18 11:40:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-11-18 11:40:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 829. [2018-11-18 11:40:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-11-18 11:40:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1142 transitions. [2018-11-18 11:40:06,001 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1142 transitions. Word has length 48 [2018-11-18 11:40:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,002 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1142 transitions. [2018-11-18 11:40:06,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1142 transitions. [2018-11-18 11:40:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 11:40:06,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,004 INFO L375 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-18 11:40:06,004 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1783806924, now seen corresponding path program 1 times [2018-11-18 11:40:06,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,063 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-18 11:40:06,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:06,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:40:06,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:40:06,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:40:06,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:40:06,064 INFO L87 Difference]: Start difference. First operand 829 states and 1142 transitions. Second operand 8 states. [2018-11-18 11:40:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:06,205 INFO L93 Difference]: Finished difference Result 855 states and 1176 transitions. [2018-11-18 11:40:06,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:40:06,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 11:40:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:06,209 INFO L225 Difference]: With dead ends: 855 [2018-11-18 11:40:06,209 INFO L226 Difference]: Without dead ends: 851 [2018-11-18 11:40:06,210 INFO L604 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-18 11:40:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-18 11:40:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 848. [2018-11-18 11:40:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-11-18 11:40:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1169 transitions. [2018-11-18 11:40:06,255 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1169 transitions. Word has length 49 [2018-11-18 11:40:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,255 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1169 transitions. [2018-11-18 11:40:06,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:40:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1169 transitions. [2018-11-18 11:40:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 11:40:06,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,259 INFO L375 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-18 11:40:06,259 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1783530094, now seen corresponding path program 1 times [2018-11-18 11:40:06,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,315 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-18 11:40:06,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:06,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:40:06,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:40:06,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:40:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:40:06,316 INFO L87 Difference]: Start difference. First operand 848 states and 1169 transitions. Second operand 8 states. [2018-11-18 11:40:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:06,417 INFO L93 Difference]: Finished difference Result 890 states and 1221 transitions. [2018-11-18 11:40:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:40:06,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 11:40:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:06,421 INFO L225 Difference]: With dead ends: 890 [2018-11-18 11:40:06,421 INFO L226 Difference]: Without dead ends: 869 [2018-11-18 11:40:06,422 INFO L604 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-18 11:40:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-18 11:40:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 868. [2018-11-18 11:40:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-11-18 11:40:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1193 transitions. [2018-11-18 11:40:06,471 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1193 transitions. Word has length 49 [2018-11-18 11:40:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,471 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 1193 transitions. [2018-11-18 11:40:06,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:40:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1193 transitions. [2018-11-18 11:40:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 11:40:06,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,473 INFO L375 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-18 11:40:06,473 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1751655904, now seen corresponding path program 1 times [2018-11-18 11:40:06,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,501 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-18 11:40:06,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:06,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:06,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:06,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:06,502 INFO L87 Difference]: Start difference. First operand 868 states and 1193 transitions. Second operand 3 states. [2018-11-18 11:40:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:06,608 INFO L93 Difference]: Finished difference Result 1087 states and 1478 transitions. [2018-11-18 11:40:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:06,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 11:40:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:06,612 INFO L225 Difference]: With dead ends: 1087 [2018-11-18 11:40:06,612 INFO L226 Difference]: Without dead ends: 1055 [2018-11-18 11:40:06,613 INFO L604 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-18 11:40:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-11-18 11:40:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 948. [2018-11-18 11:40:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-11-18 11:40:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1285 transitions. [2018-11-18 11:40:06,664 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1285 transitions. Word has length 50 [2018-11-18 11:40:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,664 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 1285 transitions. [2018-11-18 11:40:06,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1285 transitions. [2018-11-18 11:40:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 11:40:06,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,668 INFO L375 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-18 11:40:06,668 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1898348706, now seen corresponding path program 1 times [2018-11-18 11:40:06,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,743 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-18 11:40:06,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:06,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:40:06,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:40:06,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:40:06,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:40:06,744 INFO L87 Difference]: Start difference. First operand 948 states and 1285 transitions. Second operand 7 states. [2018-11-18 11:40:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:07,940 INFO L93 Difference]: Finished difference Result 1114 states and 1559 transitions. [2018-11-18 11:40:07,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:40:07,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-18 11:40:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:07,944 INFO L225 Difference]: With dead ends: 1114 [2018-11-18 11:40:07,944 INFO L226 Difference]: Without dead ends: 1020 [2018-11-18 11:40:07,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:40:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-11-18 11:40:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 878. [2018-11-18 11:40:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-11-18 11:40:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1184 transitions. [2018-11-18 11:40:08,002 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1184 transitions. Word has length 50 [2018-11-18 11:40:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:08,002 INFO L480 AbstractCegarLoop]: Abstraction has 878 states and 1184 transitions. [2018-11-18 11:40:08,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:40:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1184 transitions. [2018-11-18 11:40:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 11:40:08,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:08,005 INFO L375 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-18 11:40:08,005 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:08,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1307715265, now seen corresponding path program 1 times [2018-11-18 11:40:08,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:08,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:08,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:08,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:08,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:08,132 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-18 11:40:08,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:08,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:40:08,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:40:08,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:40:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:40:08,133 INFO L87 Difference]: Start difference. First operand 878 states and 1184 transitions. Second operand 9 states. [2018-11-18 11:40:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:09,469 INFO L93 Difference]: Finished difference Result 1192 states and 1644 transitions. [2018-11-18 11:40:09,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 11:40:09,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-18 11:40:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:09,473 INFO L225 Difference]: With dead ends: 1192 [2018-11-18 11:40:09,473 INFO L226 Difference]: Without dead ends: 1123 [2018-11-18 11:40:09,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:40:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-18 11:40:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 891. [2018-11-18 11:40:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-11-18 11:40:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1209 transitions. [2018-11-18 11:40:09,510 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1209 transitions. Word has length 50 [2018-11-18 11:40:09,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:09,510 INFO L480 AbstractCegarLoop]: Abstraction has 891 states and 1209 transitions. [2018-11-18 11:40:09,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:40:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1209 transitions. [2018-11-18 11:40:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 11:40:09,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:09,512 INFO L375 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-18 11:40:09,512 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash -212723345, now seen corresponding path program 1 times [2018-11-18 11:40:09,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:09,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:09,542 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-18 11:40:09,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:09,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:09,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:09,543 INFO L87 Difference]: Start difference. First operand 891 states and 1209 transitions. Second operand 3 states. [2018-11-18 11:40:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:09,599 INFO L93 Difference]: Finished difference Result 916 states and 1237 transitions. [2018-11-18 11:40:09,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:09,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-18 11:40:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:09,602 INFO L225 Difference]: With dead ends: 916 [2018-11-18 11:40:09,602 INFO L226 Difference]: Without dead ends: 911 [2018-11-18 11:40:09,603 INFO L604 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-18 11:40:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-11-18 11:40:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 907. [2018-11-18 11:40:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-18 11:40:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1228 transitions. [2018-11-18 11:40:09,638 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1228 transitions. Word has length 52 [2018-11-18 11:40:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:09,638 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1228 transitions. [2018-11-18 11:40:09,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1228 transitions. [2018-11-18 11:40:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 11:40:09,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:09,640 INFO L375 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] [2018-11-18 11:40:09,640 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:09,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1458849901, now seen corresponding path program 1 times [2018-11-18 11:40:09,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:09,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:09,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:09,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-18 11:40:09,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:09,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:09,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:09,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:09,671 INFO L87 Difference]: Start difference. First operand 907 states and 1228 transitions. Second operand 3 states. [2018-11-18 11:40:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:09,746 INFO L93 Difference]: Finished difference Result 1123 states and 1518 transitions. [2018-11-18 11:40:09,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:09,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-18 11:40:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:09,749 INFO L225 Difference]: With dead ends: 1123 [2018-11-18 11:40:09,750 INFO L226 Difference]: Without dead ends: 879 [2018-11-18 11:40:09,751 INFO L604 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-18 11:40:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-18 11:40:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2018-11-18 11:40:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-18 11:40:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1191 transitions. [2018-11-18 11:40:09,788 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1191 transitions. Word has length 54 [2018-11-18 11:40:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:09,788 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1191 transitions. [2018-11-18 11:40:09,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1191 transitions. [2018-11-18 11:40:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 11:40:09,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:09,790 INFO L375 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-18 11:40:09,790 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:09,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1855862492, now seen corresponding path program 1 times [2018-11-18 11:40:09,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:09,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:09,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:09,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:09,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:09,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:09,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:09,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:09,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:09,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:09,837 INFO L87 Difference]: Start difference. First operand 879 states and 1191 transitions. Second operand 5 states. [2018-11-18 11:40:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:10,125 INFO L93 Difference]: Finished difference Result 889 states and 1199 transitions. [2018-11-18 11:40:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:10,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 11:40:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:10,128 INFO L225 Difference]: With dead ends: 889 [2018-11-18 11:40:10,128 INFO L226 Difference]: Without dead ends: 883 [2018-11-18 11:40:10,129 INFO L604 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-18 11:40:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-11-18 11:40:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 879. [2018-11-18 11:40:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-18 11:40:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1190 transitions. [2018-11-18 11:40:10,163 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1190 transitions. Word has length 53 [2018-11-18 11:40:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:10,164 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1190 transitions. [2018-11-18 11:40:10,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1190 transitions. [2018-11-18 11:40:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 11:40:10,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:10,165 INFO L375 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-18 11:40:10,166 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:10,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash -14681562, now seen corresponding path program 1 times [2018-11-18 11:40:10,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:10,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:10,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:10,199 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-18 11:40:10,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:10,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:10,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:10,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:10,200 INFO L87 Difference]: Start difference. First operand 879 states and 1190 transitions. Second operand 5 states. [2018-11-18 11:40:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:10,552 INFO L93 Difference]: Finished difference Result 891 states and 1201 transitions. [2018-11-18 11:40:10,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:10,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-18 11:40:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:10,556 INFO L225 Difference]: With dead ends: 891 [2018-11-18 11:40:10,556 INFO L226 Difference]: Without dead ends: 855 [2018-11-18 11:40:10,558 INFO L604 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-18 11:40:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-11-18 11:40:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 851. [2018-11-18 11:40:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-18 11:40:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1158 transitions. [2018-11-18 11:40:10,619 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1158 transitions. Word has length 52 [2018-11-18 11:40:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:10,619 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1158 transitions. [2018-11-18 11:40:10,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1158 transitions. [2018-11-18 11:40:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 11:40:10,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:10,622 INFO L375 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] [2018-11-18 11:40:10,622 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:10,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1965789300, now seen corresponding path program 1 times [2018-11-18 11:40:10,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:10,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:10,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:10,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:10,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:10,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-18 11:40:10,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:10,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:10,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:10,673 INFO L87 Difference]: Start difference. First operand 851 states and 1158 transitions. Second operand 5 states. [2018-11-18 11:40:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:11,127 INFO L93 Difference]: Finished difference Result 859 states and 1164 transitions. [2018-11-18 11:40:11,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:11,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 11:40:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:11,131 INFO L225 Difference]: With dead ends: 859 [2018-11-18 11:40:11,131 INFO L226 Difference]: Without dead ends: 853 [2018-11-18 11:40:11,132 INFO L604 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-18 11:40:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-18 11:40:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 851. [2018-11-18 11:40:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-18 11:40:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1157 transitions. [2018-11-18 11:40:11,185 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1157 transitions. Word has length 54 [2018-11-18 11:40:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:11,185 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1157 transitions. [2018-11-18 11:40:11,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1157 transitions. [2018-11-18 11:40:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 11:40:11,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:11,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:11,188 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:11,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1122077901, now seen corresponding path program 1 times [2018-11-18 11:40:11,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:11,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:11,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:11,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:40:11,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:40:11,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:40:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:40:11,273 INFO L87 Difference]: Start difference. First operand 851 states and 1157 transitions. Second operand 4 states. [2018-11-18 11:40:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:11,433 INFO L93 Difference]: Finished difference Result 890 states and 1198 transitions. [2018-11-18 11:40:11,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:40:11,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-18 11:40:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:11,437 INFO L225 Difference]: With dead ends: 890 [2018-11-18 11:40:11,437 INFO L226 Difference]: Without dead ends: 858 [2018-11-18 11:40:11,437 INFO L604 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-18 11:40:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-18 11:40:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 853. [2018-11-18 11:40:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-11-18 11:40:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1159 transitions. [2018-11-18 11:40:11,496 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1159 transitions. Word has length 55 [2018-11-18 11:40:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:11,498 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1159 transitions. [2018-11-18 11:40:11,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:40:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1159 transitions. [2018-11-18 11:40:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 11:40:11,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:11,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:11,500 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:11,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash 612604811, now seen corresponding path program 1 times [2018-11-18 11:40:11,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:11,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:11,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:11,559 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-18 11:40:11,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:11,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:40:11,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:40:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:40:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:40:11,560 INFO L87 Difference]: Start difference. First operand 853 states and 1159 transitions. Second operand 9 states. [2018-11-18 11:40:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:11,736 INFO L93 Difference]: Finished difference Result 880 states and 1189 transitions. [2018-11-18 11:40:11,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:40:11,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-18 11:40:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:11,739 INFO L225 Difference]: With dead ends: 880 [2018-11-18 11:40:11,739 INFO L226 Difference]: Without dead ends: 842 [2018-11-18 11:40:11,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-11-18 11:40:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2018-11-18 11:40:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-11-18 11:40:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1133 transitions. [2018-11-18 11:40:11,798 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1133 transitions. Word has length 55 [2018-11-18 11:40:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:11,798 INFO L480 AbstractCegarLoop]: Abstraction has 842 states and 1133 transitions. [2018-11-18 11:40:11,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:40:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1133 transitions. [2018-11-18 11:40:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 11:40:11,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:11,800 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:11,801 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:11,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash 651629811, now seen corresponding path program 1 times [2018-11-18 11:40:11,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:11,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:11,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:11,890 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-18 11:40:11,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:11,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 11:40:11,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:40:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:40:11,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:40:11,892 INFO L87 Difference]: Start difference. First operand 842 states and 1133 transitions. Second operand 10 states. [2018-11-18 11:40:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:12,142 INFO L93 Difference]: Finished difference Result 858 states and 1150 transitions. [2018-11-18 11:40:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 11:40:12,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-18 11:40:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:12,145 INFO L225 Difference]: With dead ends: 858 [2018-11-18 11:40:12,145 INFO L226 Difference]: Without dead ends: 840 [2018-11-18 11:40:12,146 INFO L604 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-18 11:40:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-18 11:40:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2018-11-18 11:40:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-18 11:40:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1129 transitions. [2018-11-18 11:40:12,208 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1129 transitions. Word has length 55 [2018-11-18 11:40:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:12,208 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1129 transitions. [2018-11-18 11:40:12,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:40:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1129 transitions. [2018-11-18 11:40:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 11:40:12,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:12,210 INFO L375 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-18 11:40:12,210 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:12,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1391045094, now seen corresponding path program 1 times [2018-11-18 11:40:12,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:12,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:12,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:12,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:12,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:12,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:12,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 11:40:12,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:40:12,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:40:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:40:12,300 INFO L87 Difference]: Start difference. First operand 840 states and 1129 transitions. Second operand 10 states. [2018-11-18 11:40:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:12,443 INFO L93 Difference]: Finished difference Result 853 states and 1143 transitions. [2018-11-18 11:40:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 11:40:12,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-18 11:40:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:12,446 INFO L225 Difference]: With dead ends: 853 [2018-11-18 11:40:12,446 INFO L226 Difference]: Without dead ends: 835 [2018-11-18 11:40:12,447 INFO L604 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-18 11:40:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-18 11:40:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2018-11-18 11:40:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-11-18 11:40:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1122 transitions. [2018-11-18 11:40:12,478 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1122 transitions. Word has length 56 [2018-11-18 11:40:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:12,479 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1122 transitions. [2018-11-18 11:40:12,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:40:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1122 transitions. [2018-11-18 11:40:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 11:40:12,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:12,481 INFO L375 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] [2018-11-18 11:40:12,481 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:12,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1946185868, now seen corresponding path program 1 times [2018-11-18 11:40:12,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:12,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:12,526 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-18 11:40:12,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:12,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:12,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:12,527 INFO L87 Difference]: Start difference. First operand 835 states and 1122 transitions. Second operand 5 states. [2018-11-18 11:40:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:13,096 INFO L93 Difference]: Finished difference Result 1388 states and 1935 transitions. [2018-11-18 11:40:13,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:13,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-18 11:40:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:13,105 INFO L225 Difference]: With dead ends: 1388 [2018-11-18 11:40:13,105 INFO L226 Difference]: Without dead ends: 1222 [2018-11-18 11:40:13,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:40:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2018-11-18 11:40:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 874. [2018-11-18 11:40:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-18 11:40:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1178 transitions. [2018-11-18 11:40:13,171 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1178 transitions. Word has length 61 [2018-11-18 11:40:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:13,171 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1178 transitions. [2018-11-18 11:40:13,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1178 transitions. [2018-11-18 11:40:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 11:40:13,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:13,173 INFO L375 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-18 11:40:13,174 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:13,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1025869542, now seen corresponding path program 1 times [2018-11-18 11:40:13,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:13,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:13,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:13,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:13,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:13,353 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-18 11:40:13,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:13,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:13,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:13,354 INFO L87 Difference]: Start difference. First operand 874 states and 1178 transitions. Second operand 11 states. [2018-11-18 11:40:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:13,615 INFO L93 Difference]: Finished difference Result 891 states and 1196 transitions. [2018-11-18 11:40:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:13,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 11:40:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:13,618 INFO L225 Difference]: With dead ends: 891 [2018-11-18 11:40:13,618 INFO L226 Difference]: Without dead ends: 871 [2018-11-18 11:40:13,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-11-18 11:40:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2018-11-18 11:40:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-11-18 11:40:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1173 transitions. [2018-11-18 11:40:13,679 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1173 transitions. Word has length 58 [2018-11-18 11:40:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:13,680 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1173 transitions. [2018-11-18 11:40:13,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1173 transitions. [2018-11-18 11:40:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 11:40:13,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:13,682 INFO L375 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] [2018-11-18 11:40:13,682 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:13,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 161227665, now seen corresponding path program 1 times [2018-11-18 11:40:13,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:13,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:13,806 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-18 11:40:13,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:13,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 11:40:13,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 11:40:13,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 11:40:13,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:40:13,807 INFO L87 Difference]: Start difference. First operand 871 states and 1173 transitions. Second operand 12 states. [2018-11-18 11:40:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:14,029 INFO L93 Difference]: Finished difference Result 897 states and 1201 transitions. [2018-11-18 11:40:14,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:14,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-18 11:40:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:14,032 INFO L225 Difference]: With dead ends: 897 [2018-11-18 11:40:14,032 INFO L226 Difference]: Without dead ends: 872 [2018-11-18 11:40:14,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:40:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-11-18 11:40:14,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-11-18 11:40:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-18 11:40:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1162 transitions. [2018-11-18 11:40:14,091 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1162 transitions. Word has length 59 [2018-11-18 11:40:14,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:14,091 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1162 transitions. [2018-11-18 11:40:14,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 11:40:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1162 transitions. [2018-11-18 11:40:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 11:40:14,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:14,094 INFO L375 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] [2018-11-18 11:40:14,094 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:14,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:14,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1584207719, now seen corresponding path program 1 times [2018-11-18 11:40:14,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:14,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:14,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:14,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:14,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:14,138 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-18 11:40:14,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:14,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:14,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:14,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:14,139 INFO L87 Difference]: Start difference. First operand 870 states and 1162 transitions. Second operand 3 states. [2018-11-18 11:40:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:14,185 INFO L93 Difference]: Finished difference Result 904 states and 1196 transitions. [2018-11-18 11:40:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:14,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-18 11:40:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:14,187 INFO L225 Difference]: With dead ends: 904 [2018-11-18 11:40:14,187 INFO L226 Difference]: Without dead ends: 872 [2018-11-18 11:40:14,188 INFO L604 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-18 11:40:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-11-18 11:40:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-11-18 11:40:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-18 11:40:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1161 transitions. [2018-11-18 11:40:14,237 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1161 transitions. Word has length 59 [2018-11-18 11:40:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:14,238 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1161 transitions. [2018-11-18 11:40:14,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1161 transitions. [2018-11-18 11:40:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 11:40:14,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:14,240 INFO L375 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] [2018-11-18 11:40:14,240 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:14,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1074734629, now seen corresponding path program 1 times [2018-11-18 11:40:14,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:14,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:14,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:14,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:14,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:14,298 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-18 11:40:14,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:14,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:40:14,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:40:14,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:40:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:40:14,299 INFO L87 Difference]: Start difference. First operand 870 states and 1161 transitions. Second operand 9 states. [2018-11-18 11:40:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:14,404 INFO L93 Difference]: Finished difference Result 892 states and 1184 transitions. [2018-11-18 11:40:14,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:40:14,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-18 11:40:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:14,407 INFO L225 Difference]: With dead ends: 892 [2018-11-18 11:40:14,407 INFO L226 Difference]: Without dead ends: 858 [2018-11-18 11:40:14,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-18 11:40:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2018-11-18 11:40:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-11-18 11:40:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1141 transitions. [2018-11-18 11:40:14,464 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1141 transitions. Word has length 59 [2018-11-18 11:40:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:14,465 INFO L480 AbstractCegarLoop]: Abstraction has 858 states and 1141 transitions. [2018-11-18 11:40:14,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:40:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1141 transitions. [2018-11-18 11:40:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 11:40:14,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:14,467 INFO L375 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] [2018-11-18 11:40:14,468 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:14,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 518615990, now seen corresponding path program 1 times [2018-11-18 11:40:14,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:14,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:14,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:14,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:14,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:14,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:14,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:40:14,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:40:14,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:40:14,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:40:14,529 INFO L87 Difference]: Start difference. First operand 858 states and 1141 transitions. Second operand 4 states. [2018-11-18 11:40:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:14,661 INFO L93 Difference]: Finished difference Result 1014 states and 1364 transitions. [2018-11-18 11:40:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:40:14,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-18 11:40:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:14,665 INFO L225 Difference]: With dead ends: 1014 [2018-11-18 11:40:14,665 INFO L226 Difference]: Without dead ends: 903 [2018-11-18 11:40:14,666 INFO L604 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-18 11:40:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-11-18 11:40:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 865. [2018-11-18 11:40:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 11:40:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1157 transitions. [2018-11-18 11:40:14,722 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1157 transitions. Word has length 60 [2018-11-18 11:40:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:14,722 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1157 transitions. [2018-11-18 11:40:14,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:40:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1157 transitions. [2018-11-18 11:40:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 11:40:14,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:14,726 INFO L375 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] [2018-11-18 11:40:14,726 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:14,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash 793375604, now seen corresponding path program 1 times [2018-11-18 11:40:14,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:14,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:14,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:14,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:14,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:14,820 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-18 11:40:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:14,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:14,821 INFO L87 Difference]: Start difference. First operand 865 states and 1157 transitions. Second operand 11 states. [2018-11-18 11:40:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:14,949 INFO L93 Difference]: Finished difference Result 934 states and 1250 transitions. [2018-11-18 11:40:14,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:14,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-18 11:40:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:14,952 INFO L225 Difference]: With dead ends: 934 [2018-11-18 11:40:14,952 INFO L226 Difference]: Without dead ends: 879 [2018-11-18 11:40:14,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-18 11:40:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 869. [2018-11-18 11:40:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-18 11:40:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1175 transitions. [2018-11-18 11:40:15,008 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1175 transitions. Word has length 60 [2018-11-18 11:40:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:15,009 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1175 transitions. [2018-11-18 11:40:15,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1175 transitions. [2018-11-18 11:40:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 11:40:15,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:15,011 INFO L375 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] [2018-11-18 11:40:15,012 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:15,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:15,012 INFO L82 PathProgramCache]: Analyzing trace with hash 826541143, now seen corresponding path program 1 times [2018-11-18 11:40:15,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:15,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:15,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:15,100 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-18 11:40:15,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:15,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:40:15,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:40:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:40:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:40:15,102 INFO L87 Difference]: Start difference. First operand 869 states and 1175 transitions. Second operand 9 states. [2018-11-18 11:40:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:15,250 INFO L93 Difference]: Finished difference Result 900 states and 1212 transitions. [2018-11-18 11:40:15,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:40:15,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-18 11:40:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:15,253 INFO L225 Difference]: With dead ends: 900 [2018-11-18 11:40:15,253 INFO L226 Difference]: Without dead ends: 861 [2018-11-18 11:40:15,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-11-18 11:40:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2018-11-18 11:40:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-11-18 11:40:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1159 transitions. [2018-11-18 11:40:15,287 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1159 transitions. Word has length 60 [2018-11-18 11:40:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:15,288 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1159 transitions. [2018-11-18 11:40:15,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:40:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1159 transitions. [2018-11-18 11:40:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 11:40:15,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:15,290 INFO L375 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-18 11:40:15,290 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:15,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash 940267595, now seen corresponding path program 1 times [2018-11-18 11:40:15,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:15,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:15,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:15,375 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-18 11:40:15,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:15,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 11:40:15,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 11:40:15,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 11:40:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:15,376 INFO L87 Difference]: Start difference. First operand 861 states and 1159 transitions. Second operand 13 states. [2018-11-18 11:40:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:15,571 INFO L93 Difference]: Finished difference Result 878 states and 1177 transitions. [2018-11-18 11:40:15,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:40:15,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-18 11:40:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:15,574 INFO L225 Difference]: With dead ends: 878 [2018-11-18 11:40:15,574 INFO L226 Difference]: Without dead ends: 856 [2018-11-18 11:40:15,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:40:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-18 11:40:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-18 11:40:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-18 11:40:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1152 transitions. [2018-11-18 11:40:15,640 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1152 transitions. Word has length 63 [2018-11-18 11:40:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:15,640 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1152 transitions. [2018-11-18 11:40:15,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 11:40:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1152 transitions. [2018-11-18 11:40:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:40:15,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:15,642 INFO L375 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-18 11:40:15,642 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:15,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:15,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1242279399, now seen corresponding path program 1 times [2018-11-18 11:40:15,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:15,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:15,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:15,752 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-18 11:40:15,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:15,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 11:40:15,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 11:40:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 11:40:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:15,753 INFO L87 Difference]: Start difference. First operand 856 states and 1152 transitions. Second operand 13 states. [2018-11-18 11:40:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:15,939 INFO L93 Difference]: Finished difference Result 873 states and 1170 transitions. [2018-11-18 11:40:15,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:40:15,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-18 11:40:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:15,942 INFO L225 Difference]: With dead ends: 873 [2018-11-18 11:40:15,942 INFO L226 Difference]: Without dead ends: 845 [2018-11-18 11:40:15,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:40:15,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-11-18 11:40:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-11-18 11:40:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-11-18 11:40:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1137 transitions. [2018-11-18 11:40:15,976 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1137 transitions. Word has length 69 [2018-11-18 11:40:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:15,976 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1137 transitions. [2018-11-18 11:40:15,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 11:40:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1137 transitions. [2018-11-18 11:40:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 11:40:15,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:15,978 INFO L375 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-18 11:40:15,978 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:15,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1381266646, now seen corresponding path program 1 times [2018-11-18 11:40:15,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:15,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:15,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:15,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:15,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:16,121 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-18 11:40:16,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:16,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 11:40:16,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 11:40:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 11:40:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:16,122 INFO L87 Difference]: Start difference. First operand 845 states and 1137 transitions. Second operand 13 states. [2018-11-18 11:40:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:16,322 INFO L93 Difference]: Finished difference Result 862 states and 1155 transitions. [2018-11-18 11:40:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:40:16,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-18 11:40:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:16,325 INFO L225 Difference]: With dead ends: 862 [2018-11-18 11:40:16,326 INFO L226 Difference]: Without dead ends: 840 [2018-11-18 11:40:16,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:40:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-18 11:40:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2018-11-18 11:40:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-18 11:40:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1130 transitions. [2018-11-18 11:40:16,372 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1130 transitions. Word has length 62 [2018-11-18 11:40:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:16,372 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1130 transitions. [2018-11-18 11:40:16,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 11:40:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1130 transitions. [2018-11-18 11:40:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 11:40:16,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:16,374 INFO L375 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-18 11:40:16,374 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:16,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:16,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2111475177, now seen corresponding path program 1 times [2018-11-18 11:40:16,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:16,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:16,418 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-18 11:40:16,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:16,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:16,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:16,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:16,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:16,419 INFO L87 Difference]: Start difference. First operand 840 states and 1130 transitions. Second operand 3 states. [2018-11-18 11:40:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:16,463 INFO L93 Difference]: Finished difference Result 1118 states and 1504 transitions. [2018-11-18 11:40:16,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:16,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-18 11:40:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:16,467 INFO L225 Difference]: With dead ends: 1118 [2018-11-18 11:40:16,467 INFO L226 Difference]: Without dead ends: 779 [2018-11-18 11:40:16,468 INFO L604 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-18 11:40:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-18 11:40:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 727. [2018-11-18 11:40:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-18 11:40:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 944 transitions. [2018-11-18 11:40:16,510 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 944 transitions. Word has length 62 [2018-11-18 11:40:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:16,510 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 944 transitions. [2018-11-18 11:40:16,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 944 transitions. [2018-11-18 11:40:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 11:40:16,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:16,512 INFO L375 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-18 11:40:16,512 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:16,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:16,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1768811547, now seen corresponding path program 1 times [2018-11-18 11:40:16,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:16,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:16,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:16,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:16,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:16,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 11:40:16,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 11:40:16,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 11:40:16,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:40:16,704 INFO L87 Difference]: Start difference. First operand 727 states and 944 transitions. Second operand 12 states. [2018-11-18 11:40:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:16,878 INFO L93 Difference]: Finished difference Result 749 states and 967 transitions. [2018-11-18 11:40:16,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:16,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-18 11:40:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:16,879 INFO L225 Difference]: With dead ends: 749 [2018-11-18 11:40:16,879 INFO L226 Difference]: Without dead ends: 725 [2018-11-18 11:40:16,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:40:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-18 11:40:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2018-11-18 11:40:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-18 11:40:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 940 transitions. [2018-11-18 11:40:16,908 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 940 transitions. Word has length 63 [2018-11-18 11:40:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:16,908 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 940 transitions. [2018-11-18 11:40:16,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 11:40:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 940 transitions. [2018-11-18 11:40:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 11:40:16,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:16,909 INFO L375 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] [2018-11-18 11:40:16,910 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:16,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:16,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1306248093, now seen corresponding path program 1 times [2018-11-18 11:40:16,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:16,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:16,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:16,999 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-18 11:40:16,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:16,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 11:40:16,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 11:40:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 11:40:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:40:17,000 INFO L87 Difference]: Start difference. First operand 725 states and 940 transitions. Second operand 12 states. [2018-11-18 11:40:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:17,125 INFO L93 Difference]: Finished difference Result 749 states and 965 transitions. [2018-11-18 11:40:17,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:17,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-18 11:40:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:17,126 INFO L225 Difference]: With dead ends: 749 [2018-11-18 11:40:17,126 INFO L226 Difference]: Without dead ends: 725 [2018-11-18 11:40:17,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:40:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-18 11:40:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 723. [2018-11-18 11:40:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-11-18 11:40:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 936 transitions. [2018-11-18 11:40:17,175 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 936 transitions. Word has length 66 [2018-11-18 11:40:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:17,175 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 936 transitions. [2018-11-18 11:40:17,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 11:40:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 936 transitions. [2018-11-18 11:40:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 11:40:17,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:17,177 INFO L375 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] [2018-11-18 11:40:17,177 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:17,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash -90982747, now seen corresponding path program 1 times [2018-11-18 11:40:17,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:17,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:17,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:17,253 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-18 11:40:17,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:17,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:17,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:17,254 INFO L87 Difference]: Start difference. First operand 723 states and 936 transitions. Second operand 5 states. [2018-11-18 11:40:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:17,466 INFO L93 Difference]: Finished difference Result 757 states and 975 transitions. [2018-11-18 11:40:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:17,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 11:40:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:17,468 INFO L225 Difference]: With dead ends: 757 [2018-11-18 11:40:17,469 INFO L226 Difference]: Without dead ends: 730 [2018-11-18 11:40:17,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-11-18 11:40:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 728. [2018-11-18 11:40:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-11-18 11:40:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 944 transitions. [2018-11-18 11:40:17,539 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 944 transitions. Word has length 67 [2018-11-18 11:40:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:17,539 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 944 transitions. [2018-11-18 11:40:17,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 944 transitions. [2018-11-18 11:40:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 11:40:17,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:17,542 INFO L375 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-18 11:40:17,542 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:17,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1315765278, now seen corresponding path program 1 times [2018-11-18 11:40:17,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:17,613 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-18 11:40:17,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:17,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 11:40:17,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 11:40:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 11:40:17,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:40:17,614 INFO L87 Difference]: Start difference. First operand 728 states and 944 transitions. Second operand 12 states. [2018-11-18 11:40:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:17,761 INFO L93 Difference]: Finished difference Result 752 states and 969 transitions. [2018-11-18 11:40:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:17,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-18 11:40:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:17,764 INFO L225 Difference]: With dead ends: 752 [2018-11-18 11:40:17,764 INFO L226 Difference]: Without dead ends: 728 [2018-11-18 11:40:17,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:40:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-11-18 11:40:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-11-18 11:40:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-18 11:40:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 940 transitions. [2018-11-18 11:40:17,801 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 940 transitions. Word has length 62 [2018-11-18 11:40:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:17,801 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 940 transitions. [2018-11-18 11:40:17,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 11:40:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 940 transitions. [2018-11-18 11:40:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 11:40:17,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:17,803 INFO L375 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] [2018-11-18 11:40:17,803 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:17,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash -656445962, now seen corresponding path program 1 times [2018-11-18 11:40:17,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:17,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:17,864 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-18 11:40:17,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:17,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:17,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:17,865 INFO L87 Difference]: Start difference. First operand 726 states and 940 transitions. Second operand 5 states. [2018-11-18 11:40:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:18,128 INFO L93 Difference]: Finished difference Result 976 states and 1254 transitions. [2018-11-18 11:40:18,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:18,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 11:40:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:18,130 INFO L225 Difference]: With dead ends: 976 [2018-11-18 11:40:18,130 INFO L226 Difference]: Without dead ends: 837 [2018-11-18 11:40:18,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:40:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-11-18 11:40:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 768. [2018-11-18 11:40:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-11-18 11:40:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 992 transitions. [2018-11-18 11:40:18,164 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 992 transitions. Word has length 67 [2018-11-18 11:40:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:18,164 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 992 transitions. [2018-11-18 11:40:18,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 992 transitions. [2018-11-18 11:40:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 11:40:18,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:18,166 INFO L375 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] [2018-11-18 11:40:18,166 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:18,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1524846702, now seen corresponding path program 1 times [2018-11-18 11:40:18,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:18,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:18,198 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-18 11:40:18,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:18,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:18,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:18,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:18,199 INFO L87 Difference]: Start difference. First operand 768 states and 992 transitions. Second operand 3 states. [2018-11-18 11:40:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:18,230 INFO L93 Difference]: Finished difference Result 900 states and 1167 transitions. [2018-11-18 11:40:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:18,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 11:40:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:18,232 INFO L225 Difference]: With dead ends: 900 [2018-11-18 11:40:18,232 INFO L226 Difference]: Without dead ends: 768 [2018-11-18 11:40:18,233 INFO L604 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-18 11:40:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-11-18 11:40:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2018-11-18 11:40:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-11-18 11:40:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 989 transitions. [2018-11-18 11:40:18,266 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 989 transitions. Word has length 66 [2018-11-18 11:40:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:18,266 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 989 transitions. [2018-11-18 11:40:18,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 989 transitions. [2018-11-18 11:40:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 11:40:18,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:18,268 INFO L375 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-18 11:40:18,268 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:18,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2028069485, now seen corresponding path program 1 times [2018-11-18 11:40:18,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:18,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:18,306 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-18 11:40:18,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:18,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:18,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:18,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:18,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:18,307 INFO L87 Difference]: Start difference. First operand 768 states and 989 transitions. Second operand 5 states. [2018-11-18 11:40:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:18,371 INFO L93 Difference]: Finished difference Result 822 states and 1048 transitions. [2018-11-18 11:40:18,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:18,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 11:40:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:18,374 INFO L225 Difference]: With dead ends: 822 [2018-11-18 11:40:18,374 INFO L226 Difference]: Without dead ends: 770 [2018-11-18 11:40:18,374 INFO L604 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-18 11:40:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-11-18 11:40:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 768. [2018-11-18 11:40:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-11-18 11:40:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 988 transitions. [2018-11-18 11:40:18,407 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 988 transitions. Word has length 65 [2018-11-18 11:40:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:18,407 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 988 transitions. [2018-11-18 11:40:18,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 988 transitions. [2018-11-18 11:40:18,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 11:40:18,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:18,409 INFO L375 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-18 11:40:18,409 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:18,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1565297937, now seen corresponding path program 1 times [2018-11-18 11:40:18,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:18,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:18,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:18,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:18,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:18,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:18,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:18,455 INFO L87 Difference]: Start difference. First operand 768 states and 988 transitions. Second operand 5 states. [2018-11-18 11:40:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:18,565 INFO L93 Difference]: Finished difference Result 832 states and 1063 transitions. [2018-11-18 11:40:18,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:18,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 11:40:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:18,568 INFO L225 Difference]: With dead ends: 832 [2018-11-18 11:40:18,569 INFO L226 Difference]: Without dead ends: 799 [2018-11-18 11:40:18,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:40:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-11-18 11:40:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 774. [2018-11-18 11:40:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2018-11-18 11:40:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 995 transitions. [2018-11-18 11:40:18,607 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 995 transitions. Word has length 65 [2018-11-18 11:40:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:18,607 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 995 transitions. [2018-11-18 11:40:18,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 995 transitions. [2018-11-18 11:40:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 11:40:18,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:18,609 INFO L375 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] [2018-11-18 11:40:18,609 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:18,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:18,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1088995916, now seen corresponding path program 1 times [2018-11-18 11:40:18,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:18,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:18,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:18,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:18,666 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-18 11:40:18,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:18,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:18,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:18,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:18,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:18,667 INFO L87 Difference]: Start difference. First operand 774 states and 995 transitions. Second operand 6 states. [2018-11-18 11:40:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:18,745 INFO L93 Difference]: Finished difference Result 808 states and 1029 transitions. [2018-11-18 11:40:18,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:18,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 11:40:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:18,748 INFO L225 Difference]: With dead ends: 808 [2018-11-18 11:40:18,748 INFO L226 Difference]: Without dead ends: 776 [2018-11-18 11:40:18,748 INFO L604 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-18 11:40:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-11-18 11:40:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 774. [2018-11-18 11:40:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2018-11-18 11:40:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 994 transitions. [2018-11-18 11:40:18,787 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 994 transitions. Word has length 66 [2018-11-18 11:40:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:18,787 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 994 transitions. [2018-11-18 11:40:18,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 994 transitions. [2018-11-18 11:40:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 11:40:18,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:18,789 INFO L375 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] [2018-11-18 11:40:18,789 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:18,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash 579522826, now seen corresponding path program 1 times [2018-11-18 11:40:18,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:18,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:18,860 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-18 11:40:18,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:18,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:18,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:18,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:18,861 INFO L87 Difference]: Start difference. First operand 774 states and 994 transitions. Second operand 11 states. [2018-11-18 11:40:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:19,034 INFO L93 Difference]: Finished difference Result 796 states and 1017 transitions. [2018-11-18 11:40:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:19,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-18 11:40:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:19,037 INFO L225 Difference]: With dead ends: 796 [2018-11-18 11:40:19,037 INFO L226 Difference]: Without dead ends: 770 [2018-11-18 11:40:19,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-11-18 11:40:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 764. [2018-11-18 11:40:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-11-18 11:40:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 981 transitions. [2018-11-18 11:40:19,109 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 981 transitions. Word has length 66 [2018-11-18 11:40:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:19,109 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 981 transitions. [2018-11-18 11:40:19,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 981 transitions. [2018-11-18 11:40:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 11:40:19,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:19,111 INFO L375 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-18 11:40:19,111 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:19,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1636942650, now seen corresponding path program 1 times [2018-11-18 11:40:19,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:19,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:19,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:19,206 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-18 11:40:19,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:19,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 11:40:19,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 11:40:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 11:40:19,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:40:19,207 INFO L87 Difference]: Start difference. First operand 764 states and 981 transitions. Second operand 12 states. [2018-11-18 11:40:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:19,324 INFO L93 Difference]: Finished difference Result 787 states and 1005 transitions. [2018-11-18 11:40:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:19,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-18 11:40:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:19,326 INFO L225 Difference]: With dead ends: 787 [2018-11-18 11:40:19,326 INFO L226 Difference]: Without dead ends: 764 [2018-11-18 11:40:19,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:40:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-11-18 11:40:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2018-11-18 11:40:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-11-18 11:40:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 980 transitions. [2018-11-18 11:40:19,361 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 980 transitions. Word has length 70 [2018-11-18 11:40:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:19,361 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 980 transitions. [2018-11-18 11:40:19,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 11:40:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 980 transitions. [2018-11-18 11:40:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 11:40:19,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:19,363 INFO L375 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-18 11:40:19,363 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:19,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:19,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1956424772, now seen corresponding path program 1 times [2018-11-18 11:40:19,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:19,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:19,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:19,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:19,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:19,481 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-18 11:40:19,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:19,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:19,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:19,485 INFO L87 Difference]: Start difference. First operand 764 states and 980 transitions. Second operand 14 states. [2018-11-18 11:40:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:19,622 INFO L93 Difference]: Finished difference Result 790 states and 1008 transitions. [2018-11-18 11:40:19,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:40:19,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-18 11:40:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:19,623 INFO L225 Difference]: With dead ends: 790 [2018-11-18 11:40:19,623 INFO L226 Difference]: Without dead ends: 762 [2018-11-18 11:40:19,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:40:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-18 11:40:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 760. [2018-11-18 11:40:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-11-18 11:40:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 974 transitions. [2018-11-18 11:40:19,674 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 974 transitions. Word has length 70 [2018-11-18 11:40:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:19,674 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 974 transitions. [2018-11-18 11:40:19,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 974 transitions. [2018-11-18 11:40:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 11:40:19,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:19,676 INFO L375 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] [2018-11-18 11:40:19,676 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:19,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 610617127, now seen corresponding path program 1 times [2018-11-18 11:40:19,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:19,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:19,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:19,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:19,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:19,762 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-18 11:40:19,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:19,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 11:40:19,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 11:40:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 11:40:19,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:40:19,763 INFO L87 Difference]: Start difference. First operand 760 states and 974 transitions. Second operand 12 states. [2018-11-18 11:40:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:19,882 INFO L93 Difference]: Finished difference Result 782 states and 997 transitions. [2018-11-18 11:40:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:19,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-18 11:40:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:19,884 INFO L225 Difference]: With dead ends: 782 [2018-11-18 11:40:19,884 INFO L226 Difference]: Without dead ends: 758 [2018-11-18 11:40:19,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:40:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-11-18 11:40:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2018-11-18 11:40:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-11-18 11:40:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 970 transitions. [2018-11-18 11:40:19,930 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 970 transitions. Word has length 67 [2018-11-18 11:40:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:19,930 INFO L480 AbstractCegarLoop]: Abstraction has 758 states and 970 transitions. [2018-11-18 11:40:19,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 11:40:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 970 transitions. [2018-11-18 11:40:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 11:40:19,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:19,931 INFO L375 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] [2018-11-18 11:40:19,932 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:19,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash -59264446, now seen corresponding path program 1 times [2018-11-18 11:40:19,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:19,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:19,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:19,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:19,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:19,981 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-18 11:40:19,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:19,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:19,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:19,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:19,982 INFO L87 Difference]: Start difference. First operand 758 states and 970 transitions. Second operand 5 states. [2018-11-18 11:40:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:20,064 INFO L93 Difference]: Finished difference Result 799 states and 1014 transitions. [2018-11-18 11:40:20,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:20,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 11:40:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:20,066 INFO L225 Difference]: With dead ends: 799 [2018-11-18 11:40:20,066 INFO L226 Difference]: Without dead ends: 765 [2018-11-18 11:40:20,066 INFO L604 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-18 11:40:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-18 11:40:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 758. [2018-11-18 11:40:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-11-18 11:40:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 969 transitions. [2018-11-18 11:40:20,124 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 969 transitions. Word has length 67 [2018-11-18 11:40:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:20,124 INFO L480 AbstractCegarLoop]: Abstraction has 758 states and 969 transitions. [2018-11-18 11:40:20,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 969 transitions. [2018-11-18 11:40:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 11:40:20,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:20,126 INFO L375 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] [2018-11-18 11:40:20,126 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:20,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1508193805, now seen corresponding path program 1 times [2018-11-18 11:40:20,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:20,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:20,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:20,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:20,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:20,178 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-18 11:40:20,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:20,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:20,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:20,179 INFO L87 Difference]: Start difference. First operand 758 states and 969 transitions. Second operand 6 states. [2018-11-18 11:40:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:20,350 INFO L93 Difference]: Finished difference Result 797 states and 1010 transitions. [2018-11-18 11:40:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:20,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-18 11:40:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:20,353 INFO L225 Difference]: With dead ends: 797 [2018-11-18 11:40:20,354 INFO L226 Difference]: Without dead ends: 765 [2018-11-18 11:40:20,354 INFO L604 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-18 11:40:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-18 11:40:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 760. [2018-11-18 11:40:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-11-18 11:40:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 971 transitions. [2018-11-18 11:40:20,398 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 971 transitions. Word has length 68 [2018-11-18 11:40:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:20,398 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 971 transitions. [2018-11-18 11:40:20,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 971 transitions. [2018-11-18 11:40:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 11:40:20,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:20,399 INFO L375 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] [2018-11-18 11:40:20,399 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:20,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2017666895, now seen corresponding path program 1 times [2018-11-18 11:40:20,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:20,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:20,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:20,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:20,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:20,524 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-18 11:40:20,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:20,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:20,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:20,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:20,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:20,525 INFO L87 Difference]: Start difference. First operand 760 states and 971 transitions. Second operand 11 states. [2018-11-18 11:40:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:20,613 INFO L93 Difference]: Finished difference Result 785 states and 998 transitions. [2018-11-18 11:40:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:20,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-18 11:40:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:20,615 INFO L225 Difference]: With dead ends: 785 [2018-11-18 11:40:20,615 INFO L226 Difference]: Without dead ends: 752 [2018-11-18 11:40:20,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-11-18 11:40:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2018-11-18 11:40:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-11-18 11:40:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 961 transitions. [2018-11-18 11:40:20,646 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 961 transitions. Word has length 68 [2018-11-18 11:40:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:20,646 INFO L480 AbstractCegarLoop]: Abstraction has 752 states and 961 transitions. [2018-11-18 11:40:20,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 961 transitions. [2018-11-18 11:40:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 11:40:20,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:20,647 INFO L375 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] [2018-11-18 11:40:20,647 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:20,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash 491674496, now seen corresponding path program 1 times [2018-11-18 11:40:20,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:20,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:20,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:20,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:20,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:20,716 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-18 11:40:20,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:20,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:20,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:20,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:20,716 INFO L87 Difference]: Start difference. First operand 752 states and 961 transitions. Second operand 6 states. [2018-11-18 11:40:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:20,776 INFO L93 Difference]: Finished difference Result 799 states and 1009 transitions. [2018-11-18 11:40:20,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:20,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-18 11:40:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:20,778 INFO L225 Difference]: With dead ends: 799 [2018-11-18 11:40:20,778 INFO L226 Difference]: Without dead ends: 747 [2018-11-18 11:40:20,779 INFO L604 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-18 11:40:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-11-18 11:40:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2018-11-18 11:40:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-18 11:40:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 948 transitions. [2018-11-18 11:40:20,829 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 948 transitions. Word has length 68 [2018-11-18 11:40:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:20,829 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 948 transitions. [2018-11-18 11:40:20,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 948 transitions. [2018-11-18 11:40:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 11:40:20,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:20,830 INFO L375 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] [2018-11-18 11:40:20,830 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:20,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:20,831 INFO L82 PathProgramCache]: Analyzing trace with hash -17798594, now seen corresponding path program 1 times [2018-11-18 11:40:20,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:20,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:20,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:20,905 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-18 11:40:20,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:20,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:20,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:20,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:20,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:20,906 INFO L87 Difference]: Start difference. First operand 745 states and 948 transitions. Second operand 11 states. [2018-11-18 11:40:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:20,990 INFO L93 Difference]: Finished difference Result 767 states and 971 transitions. [2018-11-18 11:40:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:20,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-18 11:40:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:20,992 INFO L225 Difference]: With dead ends: 767 [2018-11-18 11:40:20,992 INFO L226 Difference]: Without dead ends: 735 [2018-11-18 11:40:20,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-11-18 11:40:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2018-11-18 11:40:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-11-18 11:40:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 934 transitions. [2018-11-18 11:40:21,041 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 934 transitions. Word has length 68 [2018-11-18 11:40:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:21,041 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 934 transitions. [2018-11-18 11:40:21,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 934 transitions. [2018-11-18 11:40:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 11:40:21,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:21,042 INFO L375 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] [2018-11-18 11:40:21,042 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:21,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1487313881, now seen corresponding path program 1 times [2018-11-18 11:40:21,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:21,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:21,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-18 11:40:21,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:21,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:21,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:21,074 INFO L87 Difference]: Start difference. First operand 735 states and 934 transitions. Second operand 5 states. [2018-11-18 11:40:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:21,280 INFO L93 Difference]: Finished difference Result 797 states and 1014 transitions. [2018-11-18 11:40:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:21,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-18 11:40:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:21,281 INFO L225 Difference]: With dead ends: 797 [2018-11-18 11:40:21,281 INFO L226 Difference]: Without dead ends: 791 [2018-11-18 11:40:21,282 INFO L604 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-18 11:40:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-11-18 11:40:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 735. [2018-11-18 11:40:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-11-18 11:40:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 933 transitions. [2018-11-18 11:40:21,313 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 933 transitions. Word has length 68 [2018-11-18 11:40:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:21,314 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 933 transitions. [2018-11-18 11:40:21,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 933 transitions. [2018-11-18 11:40:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:40:21,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:21,314 INFO L375 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-18 11:40:21,315 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:21,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash -217966723, now seen corresponding path program 1 times [2018-11-18 11:40:21,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:21,346 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-18 11:40:21,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:21,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:21,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:21,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:21,347 INFO L87 Difference]: Start difference. First operand 735 states and 933 transitions. Second operand 5 states. [2018-11-18 11:40:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:21,396 INFO L93 Difference]: Finished difference Result 776 states and 977 transitions. [2018-11-18 11:40:21,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:21,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 11:40:21,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:21,398 INFO L225 Difference]: With dead ends: 776 [2018-11-18 11:40:21,398 INFO L226 Difference]: Without dead ends: 742 [2018-11-18 11:40:21,398 INFO L604 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-18 11:40:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-11-18 11:40:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 735. [2018-11-18 11:40:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-11-18 11:40:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 932 transitions. [2018-11-18 11:40:21,430 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 932 transitions. Word has length 69 [2018-11-18 11:40:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:21,430 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 932 transitions. [2018-11-18 11:40:21,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 932 transitions. [2018-11-18 11:40:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:40:21,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:21,431 INFO L375 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-18 11:40:21,431 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:21,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:21,431 INFO L82 PathProgramCache]: Analyzing trace with hash -195334469, now seen corresponding path program 1 times [2018-11-18 11:40:21,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:21,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:21,473 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-18 11:40:21,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:21,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:21,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:21,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:21,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:21,474 INFO L87 Difference]: Start difference. First operand 735 states and 932 transitions. Second operand 6 states. [2018-11-18 11:40:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:21,549 INFO L93 Difference]: Finished difference Result 774 states and 973 transitions. [2018-11-18 11:40:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:21,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 11:40:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:21,550 INFO L225 Difference]: With dead ends: 774 [2018-11-18 11:40:21,550 INFO L226 Difference]: Without dead ends: 742 [2018-11-18 11:40:21,551 INFO L604 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-18 11:40:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-11-18 11:40:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 737. [2018-11-18 11:40:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-18 11:40:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 934 transitions. [2018-11-18 11:40:21,604 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 934 transitions. Word has length 69 [2018-11-18 11:40:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:21,604 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 934 transitions. [2018-11-18 11:40:21,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 934 transitions. [2018-11-18 11:40:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:40:21,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:21,605 INFO L375 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-18 11:40:21,605 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:21,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash -704807559, now seen corresponding path program 1 times [2018-11-18 11:40:21,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:21,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:21,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:21,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:21,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:21,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:21,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:21,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:21,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:21,646 INFO L87 Difference]: Start difference. First operand 737 states and 934 transitions. Second operand 11 states. [2018-11-18 11:40:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:21,730 INFO L93 Difference]: Finished difference Result 762 states and 961 transitions. [2018-11-18 11:40:21,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:21,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 11:40:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:21,732 INFO L225 Difference]: With dead ends: 762 [2018-11-18 11:40:21,732 INFO L226 Difference]: Without dead ends: 730 [2018-11-18 11:40:21,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-11-18 11:40:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2018-11-18 11:40:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-18 11:40:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 925 transitions. [2018-11-18 11:40:21,764 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 925 transitions. Word has length 69 [2018-11-18 11:40:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:21,765 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 925 transitions. [2018-11-18 11:40:21,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 925 transitions. [2018-11-18 11:40:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:40:21,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:21,766 INFO L375 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-18 11:40:21,766 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:21,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash -338104504, now seen corresponding path program 1 times [2018-11-18 11:40:21,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:21,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:21,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:21,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:21,803 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-18 11:40:21,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:21,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:21,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:21,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:21,804 INFO L87 Difference]: Start difference. First operand 730 states and 925 transitions. Second operand 6 states. [2018-11-18 11:40:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:21,860 INFO L93 Difference]: Finished difference Result 769 states and 966 transitions. [2018-11-18 11:40:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:21,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 11:40:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:21,861 INFO L225 Difference]: With dead ends: 769 [2018-11-18 11:40:21,861 INFO L226 Difference]: Without dead ends: 737 [2018-11-18 11:40:21,862 INFO L604 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-18 11:40:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-18 11:40:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 732. [2018-11-18 11:40:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-11-18 11:40:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 927 transitions. [2018-11-18 11:40:21,894 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 927 transitions. Word has length 69 [2018-11-18 11:40:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:21,895 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 927 transitions. [2018-11-18 11:40:21,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 927 transitions. [2018-11-18 11:40:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:40:21,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:21,896 INFO L375 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-18 11:40:21,896 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:21,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash -847577594, now seen corresponding path program 1 times [2018-11-18 11:40:21,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:21,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:21,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-18 11:40:21,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:21,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:21,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:21,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:21,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:21,960 INFO L87 Difference]: Start difference. First operand 732 states and 927 transitions. Second operand 11 states. [2018-11-18 11:40:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:22,037 INFO L93 Difference]: Finished difference Result 757 states and 954 transitions. [2018-11-18 11:40:22,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:22,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 11:40:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:22,039 INFO L225 Difference]: With dead ends: 757 [2018-11-18 11:40:22,039 INFO L226 Difference]: Without dead ends: 727 [2018-11-18 11:40:22,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-18 11:40:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-11-18 11:40:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-18 11:40:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 920 transitions. [2018-11-18 11:40:22,071 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 920 transitions. Word has length 69 [2018-11-18 11:40:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:22,071 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 920 transitions. [2018-11-18 11:40:22,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 920 transitions. [2018-11-18 11:40:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:40:22,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:22,072 INFO L375 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-18 11:40:22,073 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:22,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:22,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1778230437, now seen corresponding path program 1 times [2018-11-18 11:40:22,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:22,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:22,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:22,148 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-18 11:40:22,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:22,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:22,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:22,149 INFO L87 Difference]: Start difference. First operand 727 states and 920 transitions. Second operand 11 states. [2018-11-18 11:40:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:22,277 INFO L93 Difference]: Finished difference Result 737 states and 929 transitions. [2018-11-18 11:40:22,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:22,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 11:40:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:22,279 INFO L225 Difference]: With dead ends: 737 [2018-11-18 11:40:22,279 INFO L226 Difference]: Without dead ends: 731 [2018-11-18 11:40:22,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-11-18 11:40:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 725. [2018-11-18 11:40:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-18 11:40:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 916 transitions. [2018-11-18 11:40:22,319 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 916 transitions. Word has length 69 [2018-11-18 11:40:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:22,319 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 916 transitions. [2018-11-18 11:40:22,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 916 transitions. [2018-11-18 11:40:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:40:22,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:22,320 INFO L375 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-18 11:40:22,321 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:22,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1778507267, now seen corresponding path program 1 times [2018-11-18 11:40:22,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:22,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:22,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:22,364 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-18 11:40:22,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:22,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:22,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:22,365 INFO L87 Difference]: Start difference. First operand 725 states and 916 transitions. Second operand 5 states. [2018-11-18 11:40:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:22,560 INFO L93 Difference]: Finished difference Result 783 states and 992 transitions. [2018-11-18 11:40:22,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:22,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 11:40:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:22,562 INFO L225 Difference]: With dead ends: 783 [2018-11-18 11:40:22,562 INFO L226 Difference]: Without dead ends: 721 [2018-11-18 11:40:22,562 INFO L604 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-18 11:40:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-18 11:40:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 669. [2018-11-18 11:40:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-11-18 11:40:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 845 transitions. [2018-11-18 11:40:22,592 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 845 transitions. Word has length 69 [2018-11-18 11:40:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:22,593 INFO L480 AbstractCegarLoop]: Abstraction has 669 states and 845 transitions. [2018-11-18 11:40:22,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 845 transitions. [2018-11-18 11:40:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 11:40:22,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:22,594 INFO L375 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] [2018-11-18 11:40:22,594 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:22,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1485554770, now seen corresponding path program 1 times [2018-11-18 11:40:22,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:22,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:22,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:22,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:22,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:22,668 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-18 11:40:22,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:22,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:40:22,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:40:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:40:22,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:40:22,669 INFO L87 Difference]: Start difference. First operand 669 states and 845 transitions. Second operand 7 states. [2018-11-18 11:40:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:22,763 INFO L93 Difference]: Finished difference Result 715 states and 892 transitions. [2018-11-18 11:40:22,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:40:22,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-18 11:40:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:22,764 INFO L225 Difference]: With dead ends: 715 [2018-11-18 11:40:22,764 INFO L226 Difference]: Without dead ends: 670 [2018-11-18 11:40:22,764 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-18 11:40:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-18 11:40:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2018-11-18 11:40:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-11-18 11:40:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 841 transitions. [2018-11-18 11:40:22,793 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 841 transitions. Word has length 74 [2018-11-18 11:40:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:22,793 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 841 transitions. [2018-11-18 11:40:22,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:40:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 841 transitions. [2018-11-18 11:40:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 11:40:22,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:22,794 INFO L375 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] [2018-11-18 11:40:22,794 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:22,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2107812652, now seen corresponding path program 1 times [2018-11-18 11:40:22,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:22,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:22,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:22,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:22,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:22,860 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-18 11:40:22,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:22,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:22,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:22,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:22,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:22,861 INFO L87 Difference]: Start difference. First operand 668 states and 841 transitions. Second operand 14 states. [2018-11-18 11:40:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:23,005 INFO L93 Difference]: Finished difference Result 690 states and 864 transitions. [2018-11-18 11:40:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:40:23,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-18 11:40:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:23,006 INFO L225 Difference]: With dead ends: 690 [2018-11-18 11:40:23,007 INFO L226 Difference]: Without dead ends: 658 [2018-11-18 11:40:23,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:40:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-11-18 11:40:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2018-11-18 11:40:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-18 11:40:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 826 transitions. [2018-11-18 11:40:23,038 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 826 transitions. Word has length 74 [2018-11-18 11:40:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:23,038 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 826 transitions. [2018-11-18 11:40:23,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 826 transitions. [2018-11-18 11:40:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 11:40:23,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:23,039 INFO L375 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] [2018-11-18 11:40:23,039 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:23,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:23,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1917322660, now seen corresponding path program 1 times [2018-11-18 11:40:23,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:23,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:23,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:23,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:23,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:23,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:23,134 INFO L87 Difference]: Start difference. First operand 658 states and 826 transitions. Second operand 14 states. [2018-11-18 11:40:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:23,248 INFO L93 Difference]: Finished difference Result 722 states and 894 transitions. [2018-11-18 11:40:23,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:40:23,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 11:40:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:23,249 INFO L225 Difference]: With dead ends: 722 [2018-11-18 11:40:23,250 INFO L226 Difference]: Without dead ends: 651 [2018-11-18 11:40:23,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:40:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-11-18 11:40:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2018-11-18 11:40:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-18 11:40:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 815 transitions. [2018-11-18 11:40:23,278 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 815 transitions. Word has length 71 [2018-11-18 11:40:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:23,278 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 815 transitions. [2018-11-18 11:40:23,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 815 transitions. [2018-11-18 11:40:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 11:40:23,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:23,279 INFO L375 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] [2018-11-18 11:40:23,279 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:23,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 283232897, now seen corresponding path program 1 times [2018-11-18 11:40:23,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:23,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:23,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:23,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:23,346 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-18 11:40:23,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:23,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:23,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:23,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:23,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:23,346 INFO L87 Difference]: Start difference. First operand 651 states and 815 transitions. Second operand 14 states. [2018-11-18 11:40:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:23,455 INFO L93 Difference]: Finished difference Result 715 states and 883 transitions. [2018-11-18 11:40:23,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:40:23,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 11:40:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:23,456 INFO L225 Difference]: With dead ends: 715 [2018-11-18 11:40:23,456 INFO L226 Difference]: Without dead ends: 645 [2018-11-18 11:40:23,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:40:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-11-18 11:40:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2018-11-18 11:40:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-11-18 11:40:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 806 transitions. [2018-11-18 11:40:23,485 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 806 transitions. Word has length 71 [2018-11-18 11:40:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:23,485 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 806 transitions. [2018-11-18 11:40:23,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 806 transitions. [2018-11-18 11:40:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 11:40:23,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:23,486 INFO L375 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-18 11:40:23,487 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:23,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1679420721, now seen corresponding path program 1 times [2018-11-18 11:40:23,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:23,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:23,542 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-18 11:40:23,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:23,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:23,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:23,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:23,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:23,543 INFO L87 Difference]: Start difference. First operand 645 states and 806 transitions. Second operand 11 states. [2018-11-18 11:40:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:23,625 INFO L93 Difference]: Finished difference Result 672 states and 836 transitions. [2018-11-18 11:40:23,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:23,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-18 11:40:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:23,626 INFO L225 Difference]: With dead ends: 672 [2018-11-18 11:40:23,626 INFO L226 Difference]: Without dead ends: 627 [2018-11-18 11:40:23,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-18 11:40:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-11-18 11:40:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-18 11:40:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 778 transitions. [2018-11-18 11:40:23,654 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 778 transitions. Word has length 72 [2018-11-18 11:40:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:23,654 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 778 transitions. [2018-11-18 11:40:23,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 778 transitions. [2018-11-18 11:40:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 11:40:23,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:23,655 INFO L375 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] [2018-11-18 11:40:23,656 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:23,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:23,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1765380645, now seen corresponding path program 1 times [2018-11-18 11:40:23,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:23,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:23,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:23,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:23,692 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-18 11:40:23,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:23,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:23,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:23,693 INFO L87 Difference]: Start difference. First operand 627 states and 778 transitions. Second operand 6 states. [2018-11-18 11:40:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:23,742 INFO L93 Difference]: Finished difference Result 668 states and 822 transitions. [2018-11-18 11:40:23,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:23,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-18 11:40:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:23,743 INFO L225 Difference]: With dead ends: 668 [2018-11-18 11:40:23,743 INFO L226 Difference]: Without dead ends: 632 [2018-11-18 11:40:23,744 INFO L604 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-18 11:40:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-11-18 11:40:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 627. [2018-11-18 11:40:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-18 11:40:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 776 transitions. [2018-11-18 11:40:23,773 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 776 transitions. Word has length 71 [2018-11-18 11:40:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:23,773 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 776 transitions. [2018-11-18 11:40:23,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 776 transitions. [2018-11-18 11:40:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 11:40:23,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:23,774 INFO L375 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] [2018-11-18 11:40:23,774 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:23,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2020113561, now seen corresponding path program 1 times [2018-11-18 11:40:23,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:23,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:23,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:23,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:23,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:23,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:23,838 INFO L87 Difference]: Start difference. First operand 627 states and 776 transitions. Second operand 11 states. [2018-11-18 11:40:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:23,911 INFO L93 Difference]: Finished difference Result 652 states and 803 transitions. [2018-11-18 11:40:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:23,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-18 11:40:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:23,912 INFO L225 Difference]: With dead ends: 652 [2018-11-18 11:40:23,912 INFO L226 Difference]: Without dead ends: 619 [2018-11-18 11:40:23,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-18 11:40:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2018-11-18 11:40:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-11-18 11:40:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 765 transitions. [2018-11-18 11:40:23,940 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 765 transitions. Word has length 71 [2018-11-18 11:40:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:23,941 INFO L480 AbstractCegarLoop]: Abstraction has 619 states and 765 transitions. [2018-11-18 11:40:23,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 765 transitions. [2018-11-18 11:40:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 11:40:23,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:23,942 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:23,942 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:23,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:23,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1006898934, now seen corresponding path program 1 times [2018-11-18 11:40:23,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:23,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:23,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:23,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:24,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:24,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:40:24,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:40:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:40:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:40:24,007 INFO L87 Difference]: Start difference. First operand 619 states and 765 transitions. Second operand 7 states. [2018-11-18 11:40:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:24,097 INFO L93 Difference]: Finished difference Result 673 states and 826 transitions. [2018-11-18 11:40:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:40:24,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-18 11:40:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:24,098 INFO L225 Difference]: With dead ends: 673 [2018-11-18 11:40:24,098 INFO L226 Difference]: Without dead ends: 617 [2018-11-18 11:40:24,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-18 11:40:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-18 11:40:24,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2018-11-18 11:40:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-18 11:40:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 755 transitions. [2018-11-18 11:40:24,125 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 755 transitions. Word has length 77 [2018-11-18 11:40:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:24,126 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 755 transitions. [2018-11-18 11:40:24,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:40:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 755 transitions. [2018-11-18 11:40:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 11:40:24,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:24,127 INFO L375 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-18 11:40:24,127 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:24,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:24,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2066807825, now seen corresponding path program 1 times [2018-11-18 11:40:24,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:24,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:24,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:24,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:24,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:24,215 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-18 11:40:24,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:24,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:24,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:24,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:24,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:24,215 INFO L87 Difference]: Start difference. First operand 613 states and 755 transitions. Second operand 14 states. [2018-11-18 11:40:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:24,347 INFO L93 Difference]: Finished difference Result 672 states and 817 transitions. [2018-11-18 11:40:24,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:40:24,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-18 11:40:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:24,349 INFO L225 Difference]: With dead ends: 672 [2018-11-18 11:40:24,349 INFO L226 Difference]: Without dead ends: 601 [2018-11-18 11:40:24,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:40:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-18 11:40:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-11-18 11:40:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-18 11:40:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 736 transitions. [2018-11-18 11:40:24,394 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 736 transitions. Word has length 72 [2018-11-18 11:40:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:24,394 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 736 transitions. [2018-11-18 11:40:24,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 736 transitions. [2018-11-18 11:40:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 11:40:24,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:24,395 INFO L375 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] [2018-11-18 11:40:24,396 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:24,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:24,396 INFO L82 PathProgramCache]: Analyzing trace with hash 772709398, now seen corresponding path program 1 times [2018-11-18 11:40:24,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:24,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:24,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:24,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:24,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:24,502 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-18 11:40:24,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:24,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 11:40:24,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 11:40:24,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 11:40:24,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:24,503 INFO L87 Difference]: Start difference. First operand 601 states and 736 transitions. Second operand 13 states. [2018-11-18 11:40:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:24,670 INFO L93 Difference]: Finished difference Result 621 states and 757 transitions. [2018-11-18 11:40:24,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:40:24,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-18 11:40:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:24,672 INFO L225 Difference]: With dead ends: 621 [2018-11-18 11:40:24,672 INFO L226 Difference]: Without dead ends: 596 [2018-11-18 11:40:24,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:40:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-11-18 11:40:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2018-11-18 11:40:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-11-18 11:40:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 728 transitions. [2018-11-18 11:40:24,713 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 728 transitions. Word has length 79 [2018-11-18 11:40:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:24,713 INFO L480 AbstractCegarLoop]: Abstraction has 596 states and 728 transitions. [2018-11-18 11:40:24,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 11:40:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 728 transitions. [2018-11-18 11:40:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 11:40:24,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:24,714 INFO L375 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-18 11:40:24,714 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:24,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1597492846, now seen corresponding path program 1 times [2018-11-18 11:40:24,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:24,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:24,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:24,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:24,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 11:40:24,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 11:40:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 11:40:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:24,819 INFO L87 Difference]: Start difference. First operand 596 states and 728 transitions. Second operand 13 states. [2018-11-18 11:40:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:24,971 INFO L93 Difference]: Finished difference Result 598 states and 729 transitions. [2018-11-18 11:40:24,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:40:24,972 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-18 11:40:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:24,973 INFO L225 Difference]: With dead ends: 598 [2018-11-18 11:40:24,973 INFO L226 Difference]: Without dead ends: 543 [2018-11-18 11:40:24,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:40:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-11-18 11:40:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2018-11-18 11:40:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-11-18 11:40:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 670 transitions. [2018-11-18 11:40:25,009 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 670 transitions. Word has length 72 [2018-11-18 11:40:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:25,009 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 670 transitions. [2018-11-18 11:40:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 11:40:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 670 transitions. [2018-11-18 11:40:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 11:40:25,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:25,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:25,010 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:25,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:25,010 INFO L82 PathProgramCache]: Analyzing trace with hash 806990906, now seen corresponding path program 1 times [2018-11-18 11:40:25,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:25,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:25,082 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-18 11:40:25,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:25,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 11:40:25,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:40:25,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:40:25,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:40:25,082 INFO L87 Difference]: Start difference. First operand 543 states and 670 transitions. Second operand 10 states. [2018-11-18 11:40:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:25,975 INFO L93 Difference]: Finished difference Result 1070 states and 1323 transitions. [2018-11-18 11:40:25,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 11:40:25,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-18 11:40:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:25,977 INFO L225 Difference]: With dead ends: 1070 [2018-11-18 11:40:25,978 INFO L226 Difference]: Without dead ends: 925 [2018-11-18 11:40:25,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:40:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-18 11:40:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 854. [2018-11-18 11:40:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-18 11:40:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1077 transitions. [2018-11-18 11:40:26,021 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1077 transitions. Word has length 73 [2018-11-18 11:40:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:26,021 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1077 transitions. [2018-11-18 11:40:26,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:40:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1077 transitions. [2018-11-18 11:40:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 11:40:26,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:26,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:26,023 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:26,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1486263160, now seen corresponding path program 1 times [2018-11-18 11:40:26,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:26,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:26,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:26,065 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-18 11:40:26,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:26,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:26,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:26,065 INFO L87 Difference]: Start difference. First operand 854 states and 1077 transitions. Second operand 6 states. [2018-11-18 11:40:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:26,485 INFO L93 Difference]: Finished difference Result 1073 states and 1321 transitions. [2018-11-18 11:40:26,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:40:26,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-18 11:40:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:26,487 INFO L225 Difference]: With dead ends: 1073 [2018-11-18 11:40:26,487 INFO L226 Difference]: Without dead ends: 968 [2018-11-18 11:40:26,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:40:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-11-18 11:40:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 924. [2018-11-18 11:40:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-11-18 11:40:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1157 transitions. [2018-11-18 11:40:26,534 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1157 transitions. Word has length 73 [2018-11-18 11:40:26,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:26,535 INFO L480 AbstractCegarLoop]: Abstraction has 924 states and 1157 transitions. [2018-11-18 11:40:26,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1157 transitions. [2018-11-18 11:40:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 11:40:26,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:26,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:26,536 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:26,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash 354205624, now seen corresponding path program 1 times [2018-11-18 11:40:26,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:26,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:26,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:26,612 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-18 11:40:26,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:26,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:26,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:26,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:26,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:26,613 INFO L87 Difference]: Start difference. First operand 924 states and 1157 transitions. Second operand 6 states. [2018-11-18 11:40:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:26,741 INFO L93 Difference]: Finished difference Result 1202 states and 1517 transitions. [2018-11-18 11:40:26,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:26,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-18 11:40:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:26,745 INFO L225 Difference]: With dead ends: 1202 [2018-11-18 11:40:26,745 INFO L226 Difference]: Without dead ends: 910 [2018-11-18 11:40:26,746 INFO L604 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-18 11:40:26,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-11-18 11:40:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2018-11-18 11:40:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-11-18 11:40:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1135 transitions. [2018-11-18 11:40:26,835 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1135 transitions. Word has length 77 [2018-11-18 11:40:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:26,835 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 1135 transitions. [2018-11-18 11:40:26,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1135 transitions. [2018-11-18 11:40:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 11:40:26,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:26,836 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 11:40:26,837 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:26,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash 774162684, now seen corresponding path program 1 times [2018-11-18 11:40:26,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:26,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:26,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:26,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:26,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:40:26,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:26,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:26,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:26,868 INFO L87 Difference]: Start difference. First operand 910 states and 1135 transitions. Second operand 5 states. [2018-11-18 11:40:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:26,923 INFO L93 Difference]: Finished difference Result 955 states and 1183 transitions. [2018-11-18 11:40:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:26,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-18 11:40:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:26,925 INFO L225 Difference]: With dead ends: 955 [2018-11-18 11:40:26,925 INFO L226 Difference]: Without dead ends: 910 [2018-11-18 11:40:26,925 INFO L604 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-18 11:40:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-11-18 11:40:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2018-11-18 11:40:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-11-18 11:40:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1133 transitions. [2018-11-18 11:40:26,979 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1133 transitions. Word has length 75 [2018-11-18 11:40:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:26,979 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 1133 transitions. [2018-11-18 11:40:26,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1133 transitions. [2018-11-18 11:40:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 11:40:26,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:26,980 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 11:40:26,980 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:26,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash 796794938, now seen corresponding path program 1 times [2018-11-18 11:40:26,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:26,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:26,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:26,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:26,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:40:27,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:27,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:27,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:27,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:27,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:27,016 INFO L87 Difference]: Start difference. First operand 910 states and 1133 transitions. Second operand 6 states. [2018-11-18 11:40:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:27,084 INFO L93 Difference]: Finished difference Result 951 states and 1175 transitions. [2018-11-18 11:40:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:27,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-18 11:40:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:27,085 INFO L225 Difference]: With dead ends: 951 [2018-11-18 11:40:27,086 INFO L226 Difference]: Without dead ends: 910 [2018-11-18 11:40:27,086 INFO L604 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-18 11:40:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-11-18 11:40:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2018-11-18 11:40:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-11-18 11:40:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1131 transitions. [2018-11-18 11:40:27,131 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1131 transitions. Word has length 75 [2018-11-18 11:40:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:27,131 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 1131 transitions. [2018-11-18 11:40:27,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1131 transitions. [2018-11-18 11:40:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 11:40:27,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:27,132 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 11:40:27,132 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:27,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:27,132 INFO L82 PathProgramCache]: Analyzing trace with hash 287321848, now seen corresponding path program 1 times [2018-11-18 11:40:27,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:27,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:27,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:27,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:40:27,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:27,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:27,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:27,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:27,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:27,220 INFO L87 Difference]: Start difference. First operand 910 states and 1131 transitions. Second operand 11 states. [2018-11-18 11:40:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:27,387 INFO L93 Difference]: Finished difference Result 932 states and 1154 transitions. [2018-11-18 11:40:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:27,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-18 11:40:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:27,390 INFO L225 Difference]: With dead ends: 932 [2018-11-18 11:40:27,390 INFO L226 Difference]: Without dead ends: 863 [2018-11-18 11:40:27,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-18 11:40:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 857. [2018-11-18 11:40:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-11-18 11:40:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1068 transitions. [2018-11-18 11:40:27,433 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1068 transitions. Word has length 75 [2018-11-18 11:40:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:27,433 INFO L480 AbstractCegarLoop]: Abstraction has 857 states and 1068 transitions. [2018-11-18 11:40:27,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1068 transitions. [2018-11-18 11:40:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 11:40:27,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:27,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:27,434 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:27,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1708498808, now seen corresponding path program 1 times [2018-11-18 11:40:27,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:27,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:27,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:27,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:27,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:27,539 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-18 11:40:27,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:27,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:27,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:27,539 INFO L87 Difference]: Start difference. First operand 857 states and 1068 transitions. Second operand 14 states. [2018-11-18 11:40:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:27,651 INFO L93 Difference]: Finished difference Result 885 states and 1097 transitions. [2018-11-18 11:40:27,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:40:27,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-18 11:40:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:27,654 INFO L225 Difference]: With dead ends: 885 [2018-11-18 11:40:27,654 INFO L226 Difference]: Without dead ends: 853 [2018-11-18 11:40:27,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:40:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-18 11:40:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2018-11-18 11:40:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-11-18 11:40:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1060 transitions. [2018-11-18 11:40:27,697 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1060 transitions. Word has length 77 [2018-11-18 11:40:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:27,697 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1060 transitions. [2018-11-18 11:40:27,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1060 transitions. [2018-11-18 11:40:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 11:40:27,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:27,698 INFO L375 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] [2018-11-18 11:40:27,698 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:27,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1468939873, now seen corresponding path program 1 times [2018-11-18 11:40:27,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:27,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:27,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:27,724 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-18 11:40:27,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:27,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:27,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:27,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:27,728 INFO L87 Difference]: Start difference. First operand 853 states and 1060 transitions. Second operand 5 states. [2018-11-18 11:40:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:27,873 INFO L93 Difference]: Finished difference Result 1099 states and 1382 transitions. [2018-11-18 11:40:27,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:40:27,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-18 11:40:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:27,875 INFO L225 Difference]: With dead ends: 1099 [2018-11-18 11:40:27,875 INFO L226 Difference]: Without dead ends: 821 [2018-11-18 11:40:27,876 INFO L604 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-18 11:40:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-11-18 11:40:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2018-11-18 11:40:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-18 11:40:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1020 transitions. [2018-11-18 11:40:27,918 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1020 transitions. Word has length 81 [2018-11-18 11:40:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:27,918 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1020 transitions. [2018-11-18 11:40:27,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1020 transitions. [2018-11-18 11:40:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 11:40:27,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:27,919 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:27,920 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:27,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1129636383, now seen corresponding path program 1 times [2018-11-18 11:40:27,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:27,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:27,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:27,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:27,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:27,984 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-18 11:40:27,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:27,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 11:40:27,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:40:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:40:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:40:27,984 INFO L87 Difference]: Start difference. First operand 821 states and 1020 transitions. Second operand 10 states. [2018-11-18 11:40:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:28,777 INFO L93 Difference]: Finished difference Result 871 states and 1069 transitions. [2018-11-18 11:40:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:28,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-18 11:40:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:28,779 INFO L225 Difference]: With dead ends: 871 [2018-11-18 11:40:28,779 INFO L226 Difference]: Without dead ends: 737 [2018-11-18 11:40:28,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:40:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-18 11:40:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 370. [2018-11-18 11:40:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 11:40:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 460 transitions. [2018-11-18 11:40:28,824 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 460 transitions. Word has length 78 [2018-11-18 11:40:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:28,824 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 460 transitions. [2018-11-18 11:40:28,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:40:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 460 transitions. [2018-11-18 11:40:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 11:40:28,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:28,825 INFO L375 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] [2018-11-18 11:40:28,825 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:28,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:28,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1835021096, now seen corresponding path program 1 times [2018-11-18 11:40:28,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:28,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:28,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:28,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-18 11:40:28,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:28,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:28,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:28,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:28,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:28,852 INFO L87 Difference]: Start difference. First operand 370 states and 460 transitions. Second operand 3 states. [2018-11-18 11:40:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:28,901 INFO L93 Difference]: Finished difference Result 413 states and 505 transitions. [2018-11-18 11:40:28,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:28,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-18 11:40:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:28,902 INFO L225 Difference]: With dead ends: 413 [2018-11-18 11:40:28,903 INFO L226 Difference]: Without dead ends: 375 [2018-11-18 11:40:28,903 INFO L604 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-18 11:40:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-18 11:40:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2018-11-18 11:40:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 11:40:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 461 transitions. [2018-11-18 11:40:28,929 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 461 transitions. Word has length 80 [2018-11-18 11:40:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:28,929 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 461 transitions. [2018-11-18 11:40:28,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 461 transitions. [2018-11-18 11:40:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 11:40:28,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:28,930 INFO L375 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] [2018-11-18 11:40:28,930 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:28,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:28,931 INFO L82 PathProgramCache]: Analyzing trace with hash 215962902, now seen corresponding path program 1 times [2018-11-18 11:40:28,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:28,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:28,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:28,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:28,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:29,008 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-18 11:40:29,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:29,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:29,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:29,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:29,008 INFO L87 Difference]: Start difference. First operand 371 states and 461 transitions. Second operand 14 states. [2018-11-18 11:40:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:29,100 INFO L93 Difference]: Finished difference Result 386 states and 477 transitions. [2018-11-18 11:40:29,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:40:29,100 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-18 11:40:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:29,101 INFO L225 Difference]: With dead ends: 386 [2018-11-18 11:40:29,101 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 11:40:29,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:40:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 11:40:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-11-18 11:40:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-18 11:40:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 391 transitions. [2018-11-18 11:40:29,124 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 391 transitions. Word has length 80 [2018-11-18 11:40:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:29,124 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 391 transitions. [2018-11-18 11:40:29,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 391 transitions. [2018-11-18 11:40:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 11:40:29,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:29,125 INFO L375 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-18 11:40:29,125 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:29,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 147020346, now seen corresponding path program 1 times [2018-11-18 11:40:29,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:29,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:29,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:29,166 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-18 11:40:29,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:29,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:29,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:29,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:29,167 INFO L87 Difference]: Start difference. First operand 313 states and 391 transitions. Second operand 6 states. [2018-11-18 11:40:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:29,293 INFO L93 Difference]: Finished difference Result 449 states and 550 transitions. [2018-11-18 11:40:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:40:29,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-18 11:40:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:29,293 INFO L225 Difference]: With dead ends: 449 [2018-11-18 11:40:29,293 INFO L226 Difference]: Without dead ends: 305 [2018-11-18 11:40:29,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:40:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-18 11:40:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 258. [2018-11-18 11:40:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-18 11:40:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 302 transitions. [2018-11-18 11:40:29,310 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 302 transitions. Word has length 83 [2018-11-18 11:40:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:29,311 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 302 transitions. [2018-11-18 11:40:29,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 302 transitions. [2018-11-18 11:40:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 11:40:29,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:29,311 INFO L375 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] [2018-11-18 11:40:29,311 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:29,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1296665093, now seen corresponding path program 1 times [2018-11-18 11:40:29,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:29,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:29,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:29,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:29,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 11:40:29,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 11:40:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 11:40:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:40:29,377 INFO L87 Difference]: Start difference. First operand 258 states and 302 transitions. Second operand 13 states. [2018-11-18 11:40:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:29,846 INFO L93 Difference]: Finished difference Result 290 states and 339 transitions. [2018-11-18 11:40:29,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:40:29,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-18 11:40:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:29,847 INFO L225 Difference]: With dead ends: 290 [2018-11-18 11:40:29,847 INFO L226 Difference]: Without dead ends: 267 [2018-11-18 11:40:29,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:40:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-18 11:40:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 258. [2018-11-18 11:40:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-18 11:40:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 301 transitions. [2018-11-18 11:40:29,864 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 301 transitions. Word has length 99 [2018-11-18 11:40:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:29,864 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 301 transitions. [2018-11-18 11:40:29,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 11:40:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 301 transitions. [2018-11-18 11:40:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 11:40:29,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:29,865 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:29,865 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:29,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash -615928922, now seen corresponding path program 1 times [2018-11-18 11:40:29,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:29,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:29,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:40:29,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:40:29,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/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-18 11:40:29,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:30,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:40:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 11:40:30,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:40:30,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-18 11:40:30,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:30,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:30,059 INFO L87 Difference]: Start difference. First operand 258 states and 301 transitions. Second operand 6 states. [2018-11-18 11:40:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:30,233 INFO L93 Difference]: Finished difference Result 432 states and 520 transitions. [2018-11-18 11:40:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:30,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-11-18 11:40:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:30,237 INFO L225 Difference]: With dead ends: 432 [2018-11-18 11:40:30,237 INFO L226 Difference]: Without dead ends: 267 [2018-11-18 11:40:30,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:40:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-18 11:40:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 254. [2018-11-18 11:40:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-18 11:40:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 295 transitions. [2018-11-18 11:40:30,263 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 295 transitions. Word has length 114 [2018-11-18 11:40:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:30,263 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 295 transitions. [2018-11-18 11:40:30,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 295 transitions. [2018-11-18 11:40:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 11:40:30,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:30,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:30,265 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:30,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1655328265, now seen corresponding path program 1 times [2018-11-18 11:40:30,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:30,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:30,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:30,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:30,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:30,348 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-18 11:40:30,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:30,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 11:40:30,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:40:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:40:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:40:30,349 INFO L87 Difference]: Start difference. First operand 254 states and 295 transitions. Second operand 10 states. [2018-11-18 11:40:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:31,054 INFO L93 Difference]: Finished difference Result 545 states and 631 transitions. [2018-11-18 11:40:31,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 11:40:31,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-11-18 11:40:31,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:31,057 INFO L225 Difference]: With dead ends: 545 [2018-11-18 11:40:31,057 INFO L226 Difference]: Without dead ends: 438 [2018-11-18 11:40:31,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-11-18 11:40:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-11-18 11:40:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 377. [2018-11-18 11:40:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-18 11:40:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 434 transitions. [2018-11-18 11:40:31,093 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 434 transitions. Word has length 101 [2018-11-18 11:40:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:31,093 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 434 transitions. [2018-11-18 11:40:31,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:40:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 434 transitions. [2018-11-18 11:40:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 11:40:31,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:31,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:31,094 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:31,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:31,094 INFO L82 PathProgramCache]: Analyzing trace with hash 221734965, now seen corresponding path program 1 times [2018-11-18 11:40:31,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:31,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:31,146 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-18 11:40:31,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:31,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:40:31,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:40:31,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:40:31,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:40:31,147 INFO L87 Difference]: Start difference. First operand 377 states and 434 transitions. Second operand 8 states. [2018-11-18 11:40:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:31,204 INFO L93 Difference]: Finished difference Result 395 states and 453 transitions. [2018-11-18 11:40:31,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:40:31,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-18 11:40:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:31,206 INFO L225 Difference]: With dead ends: 395 [2018-11-18 11:40:31,207 INFO L226 Difference]: Without dead ends: 288 [2018-11-18 11:40:31,207 INFO L604 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-18 11:40:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-18 11:40:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 151. [2018-11-18 11:40:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-18 11:40:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2018-11-18 11:40:31,225 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 101 [2018-11-18 11:40:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:31,225 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2018-11-18 11:40:31,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:40:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2018-11-18 11:40:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 11:40:31,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:31,226 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:31,226 INFO L423 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:31,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash -426361306, now seen corresponding path program 1 times [2018-11-18 11:40:31,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:31,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:31,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 11:40:31,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:31,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:31,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:31,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:31,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:31,309 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 11 states. [2018-11-18 11:40:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:31,596 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2018-11-18 11:40:31,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:40:31,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-11-18 11:40:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:31,599 INFO L225 Difference]: With dead ends: 173 [2018-11-18 11:40:31,599 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 11:40:31,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:40:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 11:40:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-11-18 11:40:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 11:40:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-11-18 11:40:31,617 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-11-18 11:40:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:31,617 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-11-18 11:40:31,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-11-18 11:40:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 11:40:31,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:31,618 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:31,618 INFO L423 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:31,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash 346903781, now seen corresponding path program 1 times [2018-11-18 11:40:31,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:31,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:31,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:31,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:31,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 11:40:31,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:40:31,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:40:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:40:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:40:31,675 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-11-18 11:40:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:31,995 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-11-18 11:40:31,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 11:40:31,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-11-18 11:40:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:31,998 INFO L225 Difference]: With dead ends: 280 [2018-11-18 11:40:31,998 INFO L226 Difference]: Without dead ends: 146 [2018-11-18 11:40:31,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-18 11:40:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-18 11:40:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-18 11:40:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 11:40:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-11-18 11:40:32,014 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-11-18 11:40:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:32,014 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-11-18 11:40:32,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:40:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-11-18 11:40:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 11:40:32,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:32,015 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:32,015 INFO L423 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:32,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash 465345255, now seen corresponding path program 1 times [2018-11-18 11:40:32,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:32,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:32,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:32,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:32,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 11:40:32,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:32,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:40:32,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:40:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:40:32,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:40:32,049 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-11-18 11:40:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:32,070 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-11-18 11:40:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:40:32,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-18 11:40:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:32,072 INFO L225 Difference]: With dead ends: 192 [2018-11-18 11:40:32,073 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 11:40:32,073 INFO L604 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-18 11:40:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 11:40:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-18 11:40:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 11:40:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-11-18 11:40:32,088 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-11-18 11:40:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:32,089 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-11-18 11:40:32,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:40:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-11-18 11:40:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 11:40:32,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:32,089 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:32,090 INFO L423 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:32,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:32,090 INFO L82 PathProgramCache]: Analyzing trace with hash -983424726, now seen corresponding path program 1 times [2018-11-18 11:40:32,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:32,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:32,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:32,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:32,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 11:40:32,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:32,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:40:32,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:40:32,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:40:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:40:32,163 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 11 states. [2018-11-18 11:40:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:32,440 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-11-18 11:40:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:40:32,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-11-18 11:40:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:32,441 INFO L225 Difference]: With dead ends: 152 [2018-11-18 11:40:32,441 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:40:32,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:40:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:40:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:40:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:40:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:40:32,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-11-18 11:40:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:32,442 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:40:32,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:40:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:40:32,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:40:32,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:40:32,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:32,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:33,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:34,903 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 1 [2018-11-18 11:40:35,012 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-18 11:40:35,289 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2018-11-18 11:40:35,737 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 100 [2018-11-18 11:40:35,939 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2018-11-18 11:40:36,087 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-11-18 11:40:36,463 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 98 [2018-11-18 11:40:36,569 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-18 11:40:36,772 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-18 11:40:37,241 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 107 [2018-11-18 11:40:37,525 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 64 [2018-11-18 11:40:38,061 WARN L180 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 99 [2018-11-18 11:40:38,338 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2018-11-18 11:40:38,458 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2018-11-18 11:40:38,674 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2018-11-18 11:40:38,909 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-11-18 11:40:39,732 WARN L180 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 113 [2018-11-18 11:40:39,939 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2018-11-18 11:40:40,231 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2018-11-18 11:40:40,374 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-18 11:40:40,827 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 107 [2018-11-18 11:40:41,700 WARN L180 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 110 [2018-11-18 11:40:41,923 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 75 [2018-11-18 11:40:42,409 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 95 [2018-11-18 11:40:42,618 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 63 [2018-11-18 11:40:42,852 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 86 [2018-11-18 11:40:43,065 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2018-11-18 11:40:43,231 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 71 [2018-11-18 11:40:43,439 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-11-18 11:40:43,744 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2018-11-18 11:40:44,184 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 107 [2018-11-18 11:40:44,407 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 76 [2018-11-18 11:40:44,525 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-11-18 11:40:45,148 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 75 [2018-11-18 11:40:45,285 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2018-11-18 11:40:45,564 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2018-11-18 11:40:45,975 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-11-18 11:40:46,118 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-11-18 11:40:46,280 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2018-11-18 11:40:46,482 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2018-11-18 11:40:47,145 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2018-11-18 11:40:47,357 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2018-11-18 11:40:47,733 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 84 [2018-11-18 11:40:47,976 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 1 [2018-11-18 11:40:48,228 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 82 [2018-11-18 11:40:48,332 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-18 11:40:48,783 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 98 [2018-11-18 11:40:49,023 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2018-11-18 11:40:49,879 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 107 [2018-11-18 11:40:50,018 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2018-11-18 11:40:50,869 WARN L180 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 110 [2018-11-18 11:40:50,983 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2018-11-18 11:40:51,206 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-11-18 11:40:51,604 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-11-18 11:40:51,935 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 61 [2018-11-18 11:40:52,127 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2018-11-18 11:40:52,528 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2018-11-18 11:40:52,867 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 68 [2018-11-18 11:40:53,068 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-18 11:40:53,386 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2018-11-18 11:40:53,746 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 70 [2018-11-18 11:40:54,147 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 91 [2018-11-18 11:40:54,253 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-18 11:40:54,408 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2018-11-18 11:40:55,013 WARN L180 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 108 [2018-11-18 11:40:55,359 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 89 [2018-11-18 11:40:55,775 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 78 [2018-11-18 11:40:56,046 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2018-11-18 11:40:56,442 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2018-11-18 11:40:56,776 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 82 [2018-11-18 11:40:57,317 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-11-18 11:40:57,489 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 74 [2018-11-18 11:40:57,625 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2018-11-18 11:40:58,086 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2018-11-18 11:40:58,735 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 64 [2018-11-18 11:40:58,920 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2018-11-18 11:40:59,168 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 76 [2018-11-18 11:40:59,477 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 92 [2018-11-18 11:40:59,933 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 87 [2018-11-18 11:41:00,046 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-11-18 11:41:00,153 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2018-11-18 11:41:00,247 INFO L425 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-11-18 11:41:00,247 INFO L421 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse1 (not (= 1 |old(~s~0)|))) (.cse0 (or .cse2 (or .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse4 .cse5 .cse6 .cse7 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse0 .cse1) (or (or (or .cse2 (or .cse3 .cse4 .cse5 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse6 .cse7) (< ~IPC~0 (+ ~SKIP2~0 3)) (< ~NP~0 1) (not (= ~myStatus~0 0)) (< 1 ~NP~0) .cse1) (not (= |old(~customIrp~0)| 0))) (or (and (= |old(~s~0)| ~s~0) (not (= 0 |SendSrbSynchronous_#in~Buffer|)) (= SendSrbSynchronous_~Buffer |SendSrbSynchronous_#in~Buffer|)) .cse0)))) [2018-11-18 11:41:00,247 INFO L425 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-11-18 11:41:00,247 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-11-18 11:41:00,247 INFO L425 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-11-18 11:41:00,248 INFO L421 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (or (or .cse0 (or .cse1 .cse2 .cse3 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse4 .cse5) (< ~IPC~0 (+ ~SKIP2~0 3)) (< ~NP~0 1) (not (= ~myStatus~0 0)) (< 1 ~NP~0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0)) (and (= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (or (= |old(~s~0)| ~s~0) (or .cse0 (or .cse1 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5)))))) [2018-11-18 11:41:00,248 INFO L425 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-11-18 11:41:00,248 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-11-18 11:41:00,248 INFO L425 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-11-18 11:41:00,248 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-11-18 11:41:00,248 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 62 83) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~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 (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,248 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-11-18 11:41:00,248 INFO L425 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-11-18 11:41:00,248 INFO L421 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse14))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse14 0) .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 .cse1) (or .cse2 .cse0 .cse1))))) [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L421 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (or (and (= |old(~customIrp~0)| ~customIrp~0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-11-18 11:41:00,249 INFO L421 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse14))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse14 0) .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 .cse1) (or .cse2 .cse0 .cse1))))) [2018-11-18 11:41:00,250 INFO L421 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (or (and (= |old(~customIrp~0)| ~customIrp~0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,250 INFO L425 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-11-18 11:41:00,250 INFO L425 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-18 11:41:00,250 INFO L421 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse14))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse14 0) .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 .cse1) (or .cse2 .cse0 .cse1))))) [2018-11-18 11:41:00,250 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 171 188) no Hoare annotation was computed. [2018-11-18 11:41:00,250 INFO L421 ceAbstractionStarter]: At program point L171-3(lines 171 188) the Hoare annotation is: (let ((.cse14 (+ ~myStatus~0 1073741637))) (let ((.cse2 (< 0 .cse14))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse14 0) .cse11 .cse12 .cse13)))) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or (and (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 .cse1) (or .cse2 .cse0 .cse1))))) [2018-11-18 11:41:00,250 INFO L425 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-11-18 11:41:00,250 INFO L421 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or .cse0 (= |old(~s~0)| ~s~0)) (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= 1 |old(~s~0)|)))))) [2018-11-18 11:41:00,250 INFO L425 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-11-18 11:41:00,251 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse1 (+ (div AG_SetStatusAndReturn_~__cil_tmp4~0 4294967296) 1))) (let ((.cse2 (<= .cse1 0)) (.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) (and (or .cse0 (and (or (< 0 .cse1) (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)) (or .cse2 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|)))) (or .cse0 (or (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status) .cse2) (not (= 1 |old(~s~0)|))) (or (and (= |old(~s~0)| ~s~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) .cse0)))) [2018-11-18 11:41:00,251 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-18 11:41:00,251 INFO L425 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-11-18 11:41:00,251 INFO L425 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-11-18 11:41:00,251 INFO L421 ceAbstractionStarter]: At program point L1786(lines 1785 1816) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= ~s~0 ~NP~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse6 0) .cse12)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~myStatus~0) .cse11 .cse12))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,251 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-11-18 11:41:00,251 INFO L425 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-11-18 11:41:00,251 INFO L421 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse14 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (and (= 0 ~pended~0) .cse14))) (let ((.cse9 (<= 1 ~NP~0)) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (= ~IPC~0 ~s~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse3 (and .cse4 .cse6 .cse8)) (.cse15 (= 0 main_~status~9)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse7 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse3) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse4 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse4 .cse9 .cse10 .cse2 .cse11 .cse6 .cse7 .cse12 .cse13 .cse8) (not (= |old(~compRegistered~0)| 0)) (and .cse4 .cse9 .cse10 .cse6 (<= 1 ~compRegistered~0) .cse12 (= ~routine~0 0) .cse14 .cse2 .cse11 .cse7 .cse13) (and .cse15 .cse7 .cse12 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 (not (= 259 main_~status~9)) .cse1 .cse2 .cse13 .cse3) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse15 .cse5 .cse7 .cse8) (not (= |old(~customIrp~0)| 0)))))) [2018-11-18 11:41:00,252 INFO L421 ceAbstractionStarter]: At program point L1754(line 1754) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,252 INFO L425 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-11-18 11:41:00,252 INFO L425 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-11-18 11:41:00,252 INFO L421 ceAbstractionStarter]: At program point L1846(line 1846) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,252 INFO L421 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse14 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (and (= 0 ~pended~0) .cse14))) (let ((.cse9 (<= 1 ~NP~0)) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (= ~IPC~0 ~s~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse3 (and .cse4 .cse6 .cse8)) (.cse15 (= 0 main_~status~9)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse7 (= ~lowerDriverReturn~0 main_~status~9))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~status~9 1073741789) 0) .cse3) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse4 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse4 .cse9 .cse10 .cse2 .cse11 .cse6 .cse7 .cse12 .cse13 .cse8) (not (= |old(~compRegistered~0)| 0)) (and .cse4 .cse9 .cse10 .cse6 (<= 1 ~compRegistered~0) .cse12 (= ~routine~0 0) .cse14 .cse2 .cse11 .cse7 .cse13) (and .cse15 .cse7 .cse12 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 (not (= 259 main_~status~9)) .cse1 .cse2 .cse13 .cse3) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse15 .cse5 .cse7 .cse8) (not (= |old(~customIrp~0)| 0)))))) [2018-11-18 11:41:00,252 INFO L425 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-11-18 11:41:00,252 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-11-18 11:41:00,252 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-11-18 11:41:00,252 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-11-18 11:41:00,252 INFO L425 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-11-18 11:41:00,253 INFO L421 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse4 (= ~lowerDriverReturn~0 main_~status~9)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse1 (<= ~s~0 ~DC~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (and (let ((.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse5 .cse6 (and .cse3 .cse4)) (and (and .cse5 .cse6 .cse3) (= ~DC~0 ~s~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and (and .cse1 .cse2 .cse0 (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~9))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~9) .cse3 .cse4) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse0 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-18 11:41:00,253 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 1716 1878) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0) (= ~myStatus~0 |old(~myStatus~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 (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,253 INFO L425 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-11-18 11:41:00,253 INFO L421 ceAbstractionStarter]: At program point L1781(lines 1780 1817) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= ~s~0 ~NP~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse6 0) .cse12)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~myStatus~0) .cse11 .cse12) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,253 INFO L421 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (= 0 main_~status~9)) (.cse4 (= ~DC~0 ~s~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (and .cse10 .cse11 .cse2)) (.cse3 (= ~IPC~0 ~s~0)) (.cse8 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9))) (or (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse4 (not (= 259 main_~status~9)) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse5 .cse6 (<= (+ main_~status~9 1073741789) 0) .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse10 (<= 1 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 (<= ~NP~0 1) .cse11 .cse1 .cse2 .cse3 .cse8) (and .cse10 .cse6 .cse9 .cse11 .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-18 11:41:00,253 INFO L425 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-11-18 11:41:00,254 INFO L421 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse9 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (and .cse9 (= 0 ~pended~0))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse5 (<= 1 ~NP~0)) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= ~NP~0 1)) (.cse2 (= ~SKIP2~0 ~s~0)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse13 (= ~DC~0 ~s~0)) (.cse14 (and .cse4 .cse1 .cse7)) (.cse15 (<= (+ ~DC~0 5) ~IPC~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (= 0 main_~status~9)) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse8 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~myStatus~0)| 0)) (and .cse4 .cse5 .cse6 .cse7 (<= 1 ~compRegistered~0) .cse8 .cse9 (= ~routine~0 0) .cse10 .cse11 .cse3 .cse12) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse4 .cse5 .cse1 .cse6 .cse10 .cse11 .cse7 .cse3 .cse8 .cse12) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse1 .cse10 .cse2 .cse7 .cse3) (and .cse13 (not (= 259 main_~status~9)) .cse14 .cse15 .cse10 .cse12) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse13 .cse14 .cse15 .cse10 (<= (+ main_~status~9 1073741789) 0)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse3 .cse8) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))))) [2018-11-18 11:41:00,254 INFO L425 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-11-18 11:41:00,254 INFO L425 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-11-18 11:41:00,254 INFO L425 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-11-18 11:41:00,254 INFO L425 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-11-18 11:41:00,254 INFO L421 ceAbstractionStarter]: At program point L1766-2(lines 1766 1769) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= ~s~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= ~s~0 ~NP~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= ~NP~0 1)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (let ((.cse6 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse6 0) .cse12)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~myStatus~0) .cse11 .cse12))) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,254 INFO L425 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-11-18 11:41:00,254 INFO L421 ceAbstractionStarter]: At program point L1791(lines 1790 1815) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,254 INFO L425 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-11-18 11:41:00,254 INFO L421 ceAbstractionStarter]: At program point L1866(line 1866) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,254 INFO L425 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L428 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L421 ceAbstractionStarter]: At program point L1860(line 1860) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,255 INFO L421 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (let ((.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< ~setEventCalled~0 1)) (.cse2 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1) (< ~NP~0 |old(~s~0)|))) (.cse3 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (< 1 ~setEventCalled~0))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse6) (< .cse6 0) .cse2 .cse3 .cse4 .cse5)))) (not (= ~customIrp~0 0))) [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (let ((.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< ~setEventCalled~0 1)) (.cse2 (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1) (< ~NP~0 |old(~s~0)|))) (.cse3 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (< 1 ~setEventCalled~0))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse6) (< .cse6 0) .cse2 .cse3 .cse4 .cse5)))) (= ~s~0 |old(~s~0)|) (not (= ~customIrp~0 0))) [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-11-18 11:41:00,255 INFO L425 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-11-18 11:41:00,256 INFO L421 ceAbstractionStarter]: At program point L2075(lines 2074 2097) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0))) [2018-11-18 11:41:00,256 INFO L421 ceAbstractionStarter]: At program point L2067(line 2067) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,256 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-11-18 11:41:00,256 INFO L421 ceAbstractionStarter]: At program point L2059(line 2059) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,256 INFO L425 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-11-18 11:41:00,256 INFO L425 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-11-18 11:41:00,256 INFO L425 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-11-18 11:41:00,256 INFO L421 ceAbstractionStarter]: At program point L2080(lines 2079 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,256 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-11-18 11:41:00,256 INFO L425 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-11-18 11:41:00,256 INFO L421 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 2042 2126) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L421 ceAbstractionStarter]: At program point L2094(lines 2050 2125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L421 ceAbstractionStarter]: At program point L2119(line 2119) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,257 INFO L421 ceAbstractionStarter]: At program point L2082(lines 2081 2096) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,257 INFO L425 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-11-18 11:41:00,257 INFO L421 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L421 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (= |old(~s~0)| ~s~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L421 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 387 431) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (= |old(~s~0)| ~s~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-11-18 11:41:00,258 INFO L425 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-11-18 11:41:00,259 INFO L421 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse24 (+ ~myStatus~0 1073741637))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< 0 .cse24)) (.cse9 (< .cse24 0)) (.cse21 (not (= 1 |old(~s~0)|))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse8 (< |old(~setEventCalled~0)| 1)) (.cse4 (< 1 ~NP~0)) (.cse11 (< 1 |old(~setEventCalled~0)|)) (.cse15 (< ~compRegistered~0 1)) (.cse16 (not (= 1 ~routine~0))) (.cse18 (= ~s~0 1)) (.cse22 (= |old(~customIrp~0)| ~customIrp~0)) (.cse19 (let ((.cse23 (or .cse0 (or .cse13 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse14 .cse10 .cse3 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse7 .cse12 .cse23 .cse21) (or .cse7 .cse1 .cse9 .cse23 .cse21)))) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or (let ((.cse2 (< ~NP~0 1)) (.cse5 (or .cse13 .cse14 .cse15 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) (not (= |old(~s~0)| ~MPR3~0)) .cse17) (or .cse18 .cse19) (or (let ((.cse20 (or .cse6 .cse14 .cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse13 (< ~NP~0 |old(~s~0)|)) .cse15 .cse3 .cse16))) (and (or .cse7 .cse8 .cse12 .cse20 .cse4 .cse21 .cse11) (or .cse7 .cse8 .cse1 .cse9 .cse20 .cse4 .cse21 .cse11))) (and (and (<= 1 ~setEventCalled~0) .cse18 (<= ~setEventCalled~0 1)) .cse22) .cse17) (or .cse22 (or .cse19 .cse17)))))) [2018-11-18 11:41:00,259 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-11-18 11:41:00,259 INFO L425 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-11-18 11:41:00,259 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-11-18 11:41:00,259 INFO L421 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse24 (+ ~myStatus~0 1073741637))) (let ((.cse15 (not (= ~myStatus~0 0))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse4 (< 0 .cse24)) (.cse12 (< .cse24 0)) (.cse22 (not (= 1 |old(~s~0)|))) (.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (not (= 0 ~pended~0))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse1 (let ((.cse23 (or .cse3 (or .cse16 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse9 .cse17 .cse13 .cse6 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse10 .cse15 .cse23 .cse22) (or .cse10 .cse4 .cse12 .cse23 .cse22)))) (.cse0 (= ~s~0 1)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse7 (< 1 ~NP~0)) (.cse14 (< 1 |old(~setEventCalled~0)|)) (.cse18 (< ~compRegistered~0 1)) (.cse19 (not (= 1 ~routine~0))) (.cse20 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or (and .cse0 .cse2) (let ((.cse5 (< ~NP~0 1)) (.cse8 (or .cse16 .cse17 .cse18 .cse19))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse3 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) (not (= |old(~s~0)| ~MPR3~0)) .cse20) (or .cse2 (or .cse1 .cse20)) (or (and (and .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse2) (or (let ((.cse21 (or .cse9 .cse17 .cse13 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse16 (< ~NP~0 |old(~s~0)|)) .cse18 .cse6 .cse19))) (and (or .cse10 .cse11 .cse15 .cse21 .cse7 .cse22 .cse14) (or .cse10 .cse11 .cse4 .cse12 .cse21 .cse7 .cse22 .cse14))) .cse20)))))) [2018-11-18 11:41:00,259 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-11-18 11:41:00,259 INFO L421 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse24 (+ ~myStatus~0 1073741637))) (let ((.cse15 (not (= ~myStatus~0 0))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse4 (< 0 .cse24)) (.cse12 (< .cse24 0)) (.cse22 (not (= 1 |old(~s~0)|))) (.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (not (= 0 ~pended~0))) (.cse13 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse1 (let ((.cse23 (or .cse3 (or .cse16 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse9 .cse17 .cse13 .cse6 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse10 .cse15 .cse23 .cse22) (or .cse10 .cse4 .cse12 .cse23 .cse22)))) (.cse0 (= ~s~0 1)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse7 (< 1 ~NP~0)) (.cse14 (< 1 |old(~setEventCalled~0)|)) (.cse18 (< ~compRegistered~0 1)) (.cse19 (not (= 1 ~routine~0))) (.cse20 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or (and .cse0 .cse2) (let ((.cse5 (< ~NP~0 1)) (.cse8 (or .cse16 .cse17 .cse18 .cse19))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse3 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) (not (= |old(~s~0)| ~MPR3~0)) .cse20) (or .cse2 (or .cse1 .cse20)) (or (and (and .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse2) (or (let ((.cse21 (or .cse9 .cse17 .cse13 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse16 (< ~NP~0 |old(~s~0)|)) .cse18 .cse6 .cse19))) (and (or .cse10 .cse11 .cse15 .cse21 .cse7 .cse22 .cse14) (or .cse10 .cse11 .cse4 .cse12 .cse21 .cse7 .cse22 .cse14))) .cse20)))))) [2018-11-18 11:41:00,260 INFO L421 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 ~pended~0))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse14 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse4 (< 1 ~NP~0)) (.cse1 (< |old(~setEventCalled~0)| 1)) (.cse6 (< 1 |old(~setEventCalled~0)|)) (.cse13 (< ~compRegistered~0 1)) (.cse15 (not (= 1 ~routine~0))) (.cse16 (not (= |old(~customIrp~0)| 0))) (.cse7 (< 0 .cse21)) (.cse8 (< .cse21 0)) (.cse0 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse2 (not (= ~myStatus~0 0))) (.cse20 (or .cse17 (or .cse12 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse9 .cse10 .cse11 .cse14 (< ~IPC~0 (+ ~DC~0 5)))) (.cse5 (not (= 1 |old(~s~0)|)))) (and (or (let ((.cse3 (or .cse9 .cse10 .cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse12 (< ~NP~0 |old(~s~0)|)) .cse13 .cse14 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6))) .cse16) (or (let ((.cse18 (< ~NP~0 1)) (.cse19 (or .cse12 .cse10 .cse13 .cse15))) (and (or .cse17 .cse7 .cse18 .cse14 .cse4 .cse19 .cse9 .cse0 .cse1 .cse8 .cse11 .cse6) (or .cse17 .cse18 .cse2 .cse14 .cse4 .cse19 .cse9 .cse0 .cse1 .cse11 .cse6))) (not (= |old(~s~0)| ~MPR3~0)) .cse16) (or .cse0 .cse7 .cse8 .cse20 .cse5) (or .cse0 .cse2 .cse20 .cse5)))) [2018-11-18 11:41:00,260 INFO L425 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-11-18 11:41:00,260 INFO L425 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-11-18 11:41:00,260 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-11-18 11:41:00,260 INFO L425 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-11-18 11:41:00,260 INFO L425 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-11-18 11:41:00,260 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse27 (+ ~myStatus~0 1073741637))) (let ((.cse8 (< |old(~setEventCalled~0)| 1)) (.cse4 (< 1 ~NP~0)) (.cse11 (< 1 |old(~setEventCalled~0)|)) (.cse15 (< ~compRegistered~0 1)) (.cse16 (not (= 1 ~routine~0))) (.cse21 (not (= |old(~customIrp~0)| 0))) (.cse12 (not (= ~myStatus~0 0))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< 0 .cse27)) (.cse9 (< .cse27 0)) (.cse25 (not (= 1 |old(~s~0)|))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse17 (= |old(~s~0)| ~s~0)) (.cse20 (= |old(~customIrp~0)| ~customIrp~0)) (.cse22 (let ((.cse26 (or .cse0 (or .cse13 (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse6 .cse14 .cse10 .cse3 (< ~IPC~0 (+ ~DC~0 5))))) (and (or .cse7 .cse12 .cse26 .cse25) (or .cse7 .cse1 .cse9 .cse26 .cse25)))) (.cse18 (<= 1 ~setEventCalled~0)) (.cse19 (<= ~setEventCalled~0 1)) (.cse23 (or (let ((.cse24 (or .cse6 .cse14 .cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (or .cse13 (< ~NP~0 |old(~s~0)|)) .cse15 .cse3 .cse16))) (and (or .cse7 .cse8 .cse12 .cse24 .cse4 .cse25 .cse11) (or .cse7 .cse8 .cse1 .cse9 .cse24 .cse4 .cse25 .cse11))) .cse21))) (and (or (let ((.cse2 (< ~NP~0 1)) (.cse5 (or .cse13 .cse14 .cse15 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) (and (and .cse17 .cse18 .cse19) .cse20) (not (= |old(~s~0)| ~MPR3~0)) .cse21) (or .cse17 .cse22) (or .cse20 .cse23) (or .cse20 (or .cse22 .cse21)) (or (and (and .cse18 .cse19) (= ~s~0 |old(~s~0)|)) .cse23))))) [2018-11-18 11:41:00,261 INFO L421 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse15 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 5)) (.cse13 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse13)) (.cse1 (< ~MPR3~0 .cse14)) (.cse3 (< ~SKIP2~0 .cse15)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (and (<= .cse13 ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (<= .cse14 ~MPR3~0) (<= .cse15 ~SKIP2~0))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse2 0) .cse10 .cse11 .cse12)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:41:00,261 INFO L425 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-11-18 11:41:00,261 INFO L421 ceAbstractionStarter]: At program point L1625(line 1625) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (and (= 0 ~pended~0) (= ~s~0 1) (<= 1 ~compRegistered~0) (= ~routine~0 0)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10 .cse11 .cse12)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-11-18 11:41:00,261 INFO L425 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-11-18 11:41:00,261 INFO L421 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 1589 1637) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse2 0) .cse10 .cse11 .cse12)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-11-18 11:41:00,261 INFO L421 ceAbstractionStarter]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-11-18 11:41:00,261 INFO L425 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-11-18 11:41:00,261 INFO L425 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-11-18 11:41:00,261 INFO L425 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-11-18 11:41:00,262 INFO L421 ceAbstractionStarter]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-11-18 11:41:00,262 INFO L425 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-11-18 11:41:00,262 INFO L425 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-11-18 11:41:00,262 INFO L425 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-11-18 11:41:00,262 INFO L425 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-11-18 11:41:00,262 INFO L425 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-11-18 11:41:00,262 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse0 (= |old(~s~0)| ~s~0))) (and (or .cse0 (or (or (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse5) (< ~IPC~0 (+ ~SKIP2~0 3)) (< ~NP~0 1) (< 1 ~NP~0) (not (= 1 |old(~s~0)|)))) (or .cse2 .cse1 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 .cse0 (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) [2018-11-18 11:41:00,262 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-11-18 11:41:00,262 INFO L421 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (or (or .cse0 .cse1 .cse2 .cse3 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~MPR3~0 1)) .cse4) (< ~IPC~0 (+ ~SKIP2~0 3)) (< ~NP~0 1) (< 1 ~NP~0) (not (= 1 |old(~s~0)|))) (or .cse1 .cse0 (not (= 0 ~routine~0)) .cse2 .cse3 .cse4 (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))))) [2018-11-18 11:41:00,262 INFO L421 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,262 INFO L425 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-11-18 11:41:00,262 INFO L421 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,263 INFO L421 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 1680 1701) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2))) [2018-11-18 11:41:00,263 INFO L425 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-11-18 11:41:00,263 INFO L425 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-11-18 11:41:00,263 INFO L425 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-11-18 11:41:00,263 INFO L425 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-11-18 11:41:00,263 INFO L425 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-11-18 11:41:00,263 INFO L421 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ ~s~0 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 ~s~0))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= ~s~0 ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1)) (.cse11 (= 0 ~pended~0))) (and (let ((.cse1 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse1 0) .cse9 .cse10 .cse11 .cse12)) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11))) [2018-11-18 11:41:00,263 INFO L425 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-11-18 11:41:00,263 INFO L421 ceAbstractionStarter]: At program point L1583(line 1583) the Hoare annotation is: (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (< ~MPR3~0 (+ ~NP~0 5)) (< 0 .cse0) (< ~SKIP1~0 (+ ~s~0 2)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 ~s~0)) (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (< .cse0 0) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~compRegistered~0 1))) [2018-11-18 11:41:00,263 INFO L425 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-11-18 11:41:00,263 INFO L421 ceAbstractionStarter]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 ~s~0))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse11) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) [2018-11-18 11:41:00,264 INFO L425 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-11-18 11:41:00,264 INFO L425 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-11-18 11:41:00,264 INFO L425 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-11-18 11:41:00,264 INFO L428 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-11-18 11:41:00,264 INFO L425 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-11-18 11:41:00,272 INFO L425 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-11-18 11:41:00,272 INFO L425 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-11-18 11:41:00,272 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-11-18 11:41:00,272 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-11-18 11:41:00,272 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-11-18 11:41:00,272 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-11-18 11:41:00,272 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,272 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-11-18 11:41:00,272 INFO L428 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-11-18 11:41:00,272 INFO L425 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-11-18 11:41:00,272 INFO L428 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-11-18 11:41:00,273 INFO L425 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-11-18 11:41:00,273 INFO L425 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-11-18 11:41:00,273 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-11-18 11:41:00,273 INFO L421 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-18 11:41:00,273 INFO L425 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-11-18 11:41:00,273 INFO L421 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) (and (and (and (= 0 ~pended~0) (= ~s~0 1) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-11-18 11:41:00,277 INFO L425 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-11-18 11:41:00,278 INFO L425 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-18 11:41:00,278 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-11-18 11:41:00,278 INFO L425 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-11-18 11:41:00,278 INFO L425 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-11-18 11:41:00,278 INFO L421 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,278 INFO L425 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-11-18 11:41:00,278 INFO L425 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-11-18 11:41:00,278 INFO L425 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-11-18 11:41:00,278 INFO L421 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,279 INFO L421 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,282 INFO L421 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 1) (<= CdAudioPnp_~setPagable~0 0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,283 INFO L425 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-11-18 11:41:00,283 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-11-18 11:41:00,283 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-18 11:41:00,283 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-18 11:41:00,283 INFO L421 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (let ((.cse14 (+ ~SKIP2~0 3)) (.cse16 (+ ~DC~0 2)) (.cse18 (+ ~NP~0 2)) (.cse17 (+ ~NP~0 5)) (.cse15 (+ ~SKIP1~0 2)) (.cse13 (+ ~MPR3~0 1))) (let ((.cse0 (and (<= .cse14 ~IPC~0) (= ~s~0 1) (and (<= .cse16 ~SKIP2~0) (and (<= .cse18 ~SKIP1~0) (= 0 ~pended~0) (<= .cse17 ~MPR3~0) (= ~s~0 ~NP~0) (<= .cse15 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (= ~routine~0 1)) (<= .cse13 ~IPC~0))))) (or (and .cse0 (<= 0 |old(~myStatus~0)|) (= 0 CdAudioPnp_~status~2) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse1 (< ~SKIP1~0 .cse18)) (.cse2 (< ~MPR3~0 .cse17)) (.cse3 (< ~SKIP2~0 .cse16)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse15)) (.cse8 (< ~IPC~0 .cse14)) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 .cse13))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11)))) (not (= |old(~customIrp~0)| 0))) (and .cse0 (<= (+ |old(~myStatus~0)| 1) 0) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| CdAudioPnp_~status~2))))) [2018-11-18 11:41:00,283 INFO L425 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-11-18 11:41:00,283 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-11-18 11:41:00,287 INFO L421 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (and (= |old(~customIrp~0)| ~customIrp~0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (<= 0 ~myStatus~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,287 INFO L421 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-18 11:41:00,287 INFO L421 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (and (and (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,287 INFO L425 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-18 11:41:00,287 INFO L425 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-11-18 11:41:00,288 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-18 11:41:00,288 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-11-18 11:41:00,288 INFO L425 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-11-18 11:41:00,288 INFO L425 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-11-18 11:41:00,288 INFO L421 ceAbstractionStarter]: At program point L241(lines 240 306) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-18 11:41:00,292 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-11-18 11:41:00,292 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-11-18 11:41:00,292 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-11-18 11:41:00,292 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-11-18 11:41:00,293 INFO L421 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,293 INFO L425 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-11-18 11:41:00,293 INFO L421 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-11-18 11:41:00,293 INFO L425 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-11-18 11:41:00,293 INFO L421 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,296 INFO L425 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-11-18 11:41:00,296 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-11-18 11:41:00,296 INFO L425 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-11-18 11:41:00,296 INFO L421 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,296 INFO L421 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0))) [2018-11-18 11:41:00,296 INFO L425 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-11-18 11:41:00,296 INFO L425 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-11-18 11:41:00,296 INFO L425 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-11-18 11:41:00,296 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-11-18 11:41:00,296 INFO L421 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,301 INFO L421 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0))) [2018-11-18 11:41:00,301 INFO L421 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,301 INFO L425 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-11-18 11:41:00,301 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-11-18 11:41:00,301 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-11-18 11:41:00,301 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-11-18 11:41:00,301 INFO L421 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,301 INFO L425 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-11-18 11:41:00,301 INFO L425 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-11-18 11:41:00,308 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-11-18 11:41:00,308 INFO L425 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-11-18 11:41:00,309 INFO L421 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11))))) [2018-11-18 11:41:00,309 INFO L425 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-11-18 11:41:00,309 INFO L421 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,309 INFO L425 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-11-18 11:41:00,309 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-11-18 11:41:00,309 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-11-18 11:41:00,309 INFO L421 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,309 INFO L425 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-11-18 11:41:00,309 INFO L421 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse0) (= 0 ~pended~0) (= ~s~0 1) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11))))) [2018-11-18 11:41:00,317 INFO L425 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-11-18 11:41:00,317 INFO L425 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-11-18 11:41:00,317 INFO L421 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,317 INFO L425 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-11-18 11:41:00,317 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-11-18 11:41:00,317 INFO L425 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-11-18 11:41:00,318 INFO L421 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (and (<= 0 .cse12) (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (<= .cse12 0)))) [2018-11-18 11:41:00,318 INFO L421 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,330 INFO L425 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-11-18 11:41:00,330 INFO L425 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-11-18 11:41:00,330 INFO L421 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,330 INFO L425 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-11-18 11:41:00,330 INFO L425 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-11-18 11:41:00,330 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-18 11:41:00,330 INFO L425 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-11-18 11:41:00,330 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-11-18 11:41:00,330 INFO L425 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-18 11:41:00,331 INFO L425 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-11-18 11:41:00,331 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-11-18 11:41:00,331 INFO L421 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse12) (<= .cse12 0)))) [2018-11-18 11:41:00,331 INFO L425 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-11-18 11:41:00,331 INFO L421 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,340 INFO L425 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-11-18 11:41:00,340 INFO L425 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-11-18 11:41:00,341 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-11-18 11:41:00,341 INFO L421 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,341 INFO L425 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-11-18 11:41:00,341 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-11-18 11:41:00,341 INFO L425 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-11-18 11:41:00,341 INFO L421 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) [2018-11-18 11:41:00,341 INFO L425 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-11-18 11:41:00,341 INFO L421 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,345 INFO L425 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L421 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L421 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (= 0 ~myStatus~0) (and (<= 0 .cse0) (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (<= .cse0 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse12 0) .cse9 .cse10 .cse11))))) [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-11-18 11:41:00,346 INFO L425 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-11-18 11:41:00,347 INFO L421 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,351 INFO L425 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-11-18 11:41:00,351 INFO L425 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-11-18 11:41:00,351 INFO L421 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse22 (+ ~myStatus~0 1073741637)) (.cse21 (+ ~NP~0 5)) (.cse20 (+ ~DC~0 2))) (let ((.cse6 (and (= ~s~0 1) (<= ~s~0 ~NP~0) (= ~routine~0 0) (<= .cse21 ~MPR3~0) (<= .cse20 ~SKIP2~0) (<= ~NP~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= 0 ~routine~0))) (.cse16 (= 0 ~pended~0)) (.cse1 (not (= ~myStatus~0 0))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< 0 .cse22)) (.cse14 (< .cse22 0)) (.cse15 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 .cse21)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse20)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 (< ~NP~0 1) .cse3 .cse15 (and .cse16 (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse8 .cse9 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or (let ((.cse17 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse18 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse17 0) .cse16 (<= 0 .cse17) (<= 1 ~setEventCalled~0) (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse18 0) (<= ~setEventCalled~0 1))) (let ((.cse19 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse8 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse9 .cse1 .cse19 .cse15 .cse4) (or .cse9 .cse13 .cse14 .cse19 .cse15 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-18 11:41:00,351 INFO L421 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse22 (+ ~myStatus~0 1073741637)) (.cse21 (+ ~NP~0 5)) (.cse20 (+ ~DC~0 2))) (let ((.cse6 (and (= ~s~0 1) (<= ~s~0 ~NP~0) (= ~routine~0 0) (<= .cse21 ~MPR3~0) (<= .cse20 ~SKIP2~0) (<= ~NP~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= 0 ~routine~0))) (.cse16 (= 0 ~pended~0)) (.cse1 (not (= ~myStatus~0 0))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< 0 .cse22)) (.cse14 (< .cse22 0)) (.cse15 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 .cse21)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse20)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 (< ~NP~0 1) .cse3 .cse15 (and .cse16 (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse8 .cse9 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or (let ((.cse17 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse18 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse17 0) .cse16 (<= 0 .cse17) (<= 1 ~setEventCalled~0) (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse18 0) (<= ~setEventCalled~0 1))) (let ((.cse19 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse8 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse9 .cse1 .cse19 .cse15 .cse4) (or .cse9 .cse13 .cse14 .cse19 .cse15 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-18 11:41:00,356 INFO L425 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-11-18 11:41:00,356 INFO L425 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-11-18 11:41:00,356 INFO L425 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-11-18 11:41:00,356 INFO L425 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-11-18 11:41:00,357 INFO L425 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-11-18 11:41:00,357 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637)) (.cse16 (= 0 ~pended~0))) (let ((.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse12 (and .cse16 (= ~s~0 1))) (.cse5 (not (= 0 ~routine~0))) (.cse14 (not (= ~myStatus~0 0))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< 0 .cse18)) (.cse9 (< .cse18 0)) (.cse15 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse13 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 (< ~NP~0 1) .cse3 .cse15 (and .cse16 (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or (and .cse16 (= |old(~s~0)| ~s~0)) (let ((.cse17 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse11 .cse13 (< ~NP~0 |old(~s~0)|)))) (and (or .cse8 .cse14 .cse17 .cse15 .cse4) (or .cse8 .cse1 .cse9 .cse17 .cse15 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-18 11:41:00,357 INFO L425 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-11-18 11:41:00,357 INFO L425 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-11-18 11:41:00,357 INFO L425 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-11-18 11:41:00,365 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-11-18 11:41:00,366 INFO L421 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse22 (+ ~myStatus~0 1073741637)) (.cse21 (+ ~NP~0 5)) (.cse20 (+ ~DC~0 2))) (let ((.cse6 (and (= ~s~0 1) (<= ~s~0 ~NP~0) (= ~routine~0 0) (<= .cse21 ~MPR3~0) (<= .cse20 ~SKIP2~0) (<= ~NP~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= 0 ~routine~0))) (.cse16 (= 0 ~pended~0)) (.cse1 (not (= ~myStatus~0 0))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< 0 .cse22)) (.cse14 (< .cse22 0)) (.cse15 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 .cse21)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse20)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 (< ~NP~0 1) .cse3 .cse15 (and .cse16 (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse8 .cse9 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or (let ((.cse17 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse18 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse17 0) .cse16 (<= 0 .cse17) (<= 1 ~setEventCalled~0) (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse18 0) (<= ~setEventCalled~0 1))) (let ((.cse19 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse8 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse9 .cse1 .cse19 .cse15 .cse4) (or .cse9 .cse13 .cse14 .cse19 .cse15 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-18 11:41:00,366 INFO L425 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-11-18 11:41:00,366 INFO L425 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-11-18 11:41:00,366 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-11-18 11:41:00,366 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-11-18 11:41:00,366 INFO L421 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse16)) (.cse9 (< .cse16 0)) (.cse15 (< 1 ~NP~0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse14 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse8 .cse13 .cse14 .cse15 .cse4) (or .cse8 .cse1 .cse9 .cse14 .cse15 .cse4))) (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 (< ~NP~0 1) .cse3 .cse15 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2018-11-18 11:41:00,366 INFO L425 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-11-18 11:41:00,367 INFO L421 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse17 (+ ~myStatus~0 1073741637))) (let ((.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse12 (and (= 0 ~pended~0) (= ~s~0 1))) (.cse14 (not (= ~myStatus~0 0))) (.cse1 (< 0 .cse17)) (.cse9 (< .cse17 0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse13 (< ~compRegistered~0 1)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (< 1 ~NP~0)) (.cse5 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (or (let ((.cse15 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse11 .cse13 (< ~NP~0 |old(~s~0)|)))) (and (or .cse8 .cse14 .cse15 .cse16 .cse4) (or .cse8 .cse1 .cse9 .cse15 .cse16 .cse4))) (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 (< ~NP~0 1) .cse3 .cse16 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11)))) [2018-11-18 11:41:00,377 INFO L425 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-11-18 11:41:00,378 INFO L421 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse22 (+ ~myStatus~0 1073741637)) (.cse21 (+ ~NP~0 5)) (.cse20 (+ ~DC~0 2))) (let ((.cse6 (and (= ~s~0 1) (<= ~s~0 ~NP~0) (= ~routine~0 0) (<= .cse21 ~MPR3~0) (<= .cse20 ~SKIP2~0) (<= ~NP~0 1) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= 0 ~routine~0))) (.cse16 (= 0 ~pended~0)) (.cse1 (not (= ~myStatus~0 0))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< 0 .cse22)) (.cse14 (< .cse22 0)) (.cse15 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 .cse21)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 .cse20)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 (< ~NP~0 1) .cse3 .cse15 (and .cse16 (= ~s~0 ~SKIP1~0)) (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse8 .cse9 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or (let ((.cse17 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse18 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse17 0) .cse16 (<= 0 .cse17) (<= 1 ~setEventCalled~0) (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse18 0) (<= ~setEventCalled~0 1))) (let ((.cse19 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse8 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse9 .cse1 .cse19 .cse15 .cse4) (or .cse9 .cse13 .cse14 .cse19 .cse15 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-18 11:41:00,378 INFO L421 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse7 (< 0 .cse18)) (.cse8 (< .cse18 0)) (.cse5 (< 1 ~NP~0)) (.cse9 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (not (= ~myStatus~0 0))) (.cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse16 (not (= 0 ~routine~0))) (.cse17 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (not (= 0 |old(~pended~0)|))) (.cse14 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse15 (< ~compRegistered~0 1))) (and (or (let ((.cse0 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse0 0) (= 0 ~pended~0) (<= 0 .cse0) (<= 1 ~setEventCalled~0) (<= 0 .cse1) (= |old(~s~0)| ~s~0) (<= .cse1 0) (<= ~setEventCalled~0 1))) (let ((.cse4 (or .cse9 .cse10 .cse11 (not (= 1 ~routine~0)) .cse12 .cse13 .cse14 .cse15 (< ~NP~0 |old(~s~0)|)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse2 .cse7 .cse8 .cse4 .cse5 .cse6))) (not (= ~customIrp~0 0))) (or .cse9 .cse7 .cse10 .cse11 .cse6 .cse16 .cse17 .cse12 .cse2 .cse8 .cse13 .cse14 .cse15) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse9 (< ~NP~0 1) .cse11 .cse5 (< ~SKIP1~0 |old(~s~0)|) .cse16 .cse12 .cse2 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse13 .cse14) (or .cse9 .cse3 .cse10 .cse11 .cse6 .cse16 .cse17 .cse12 .cse2 .cse13 .cse14 .cse15)))) [2018-11-18 11:41:00,391 INFO L421 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse16 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse14 (not (= ~myStatus~0 0))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse1 (< 0 .cse16)) (.cse9 (< .cse16 0)) (.cse13 (< 1 ~NP~0)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 (< ~NP~0 1) .cse3 .cse13 (< ~SKIP1~0 |old(~s~0)|) .cse5 .cse7 .cse8 (< |old(~s~0)| ~SKIP1~0) (not (= ~compRegistered~0 0)) .cse10 .cse11) (or .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (let ((.cse15 (or .cse0 .cse2 .cse3 (not (= 1 ~routine~0)) .cse7 .cse10 .cse11 .cse12 (< ~NP~0 |old(~s~0)|)))) (and (or .cse8 .cse14 .cse15 .cse13 .cse4) (or .cse8 .cse1 .cse9 .cse15 .cse13 .cse4))) (not (= ~customIrp~0 0)))))) [2018-11-18 11:41:00,391 INFO L425 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-11-18 11:41:00,392 INFO L425 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-11-18 11:41:00,392 INFO L425 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-11-18 11:41:00,392 INFO L421 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 365 386) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-18 11:41:00,392 INFO L421 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-18 11:41:00,392 INFO L425 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-18 11:41:00,400 INFO L421 ceAbstractionStarter]: At program point L376(line 376) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)))) [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L421 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (and (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L421 ceAbstractionStarter]: At program point L1530(line 1530) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-11-18 11:41:00,401 INFO L425 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-11-18 11:41:00,402 INFO L421 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 1499 1556) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:41:00,402 INFO L425 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-11-18 11:41:00,402 INFO L421 ceAbstractionStarter]: At program point L1552(line 1552) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:41:00,409 INFO L425 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-11-18 11:41:00,409 INFO L421 ceAbstractionStarter]: At program point L1544(line 1544) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:41:00,409 INFO L425 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-11-18 11:41:00,409 INFO L425 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-11-18 11:41:00,409 INFO L421 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,410 INFO L421 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,410 INFO L425 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-11-18 11:41:00,410 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-11-18 11:41:00,410 INFO L425 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-11-18 11:41:00,410 INFO L425 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-11-18 11:41:00,410 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-11-18 11:41:00,410 INFO L425 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-11-18 11:41:00,410 INFO L421 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse12 (+ ~NP~0 5))) (let ((.cse13 (and (= 0 ~pended~0) (<= .cse12 ~MPR3~0))) (.cse14 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse15 (= ~IPC~0 ~s~0)) (.cse16 (= ~routine~0 0))) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and .cse13 .cse14 .cse15 .cse16) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse13 .cse16 (= ~SKIP2~0 ~s~0)) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (and (not (= 259 CdAudioDeviceControl_~status~3)) (= ~DC~0 ~s~0) (and .cse13 .cse16)) (and .cse14 (<= 1 ~compRegistered~0) .cse15 .cse16)))) [2018-11-18 11:41:00,418 INFO L421 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,418 INFO L425 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-11-18 11:41:00,419 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-11-18 11:41:00,419 INFO L421 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,419 INFO L425 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-11-18 11:41:00,419 INFO L425 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-11-18 11:41:00,419 INFO L421 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,426 INFO L425 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-18 11:41:00,427 INFO L421 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10))))) [2018-11-18 11:41:00,427 INFO L421 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 1 |old(~s~0)|))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse11) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse11 0) .cse8 .cse9 .cse10)))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 1) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-11-18 11:41:00,427 INFO L425 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-11-18 11:41:00,427 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-11-18 11:41:00,427 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:41:00,427 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~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) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~UNLOADED~0 ~s~0)) [2018-11-18 11:41:00,427 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:41:00,427 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:41:00,427 INFO L421 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (let ((.cse0 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp104~1 1073741670)) (<= .cse0 0) (<= 0 .cse0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp104~1 4294967296) 1) 0)))) [2018-11-18 11:41:00,435 INFO L425 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-11-18 11:41:00,435 INFO L421 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,435 INFO L425 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-11-18 11:41:00,435 INFO L421 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp106~1 1073741670)) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp106~1 4294967296) 1) 0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-11-18 11:41:00,435 INFO L425 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-11-18 11:41:00,435 INFO L425 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-11-18 11:41:00,435 INFO L421 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-18 11:41:00,436 INFO L425 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-11-18 11:41:00,436 INFO L425 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-11-18 11:41:00,436 INFO L425 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-11-18 11:41:00,436 INFO L425 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-11-18 11:41:00,436 INFO L421 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (let ((.cse0 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse0 0) (<= 0 .cse0) (<= (+ (div CdAudio435DeviceControl_~__cil_tmp109~1 4294967296) 1) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)) (<= 0 (+ CdAudio435DeviceControl_~__cil_tmp109~1 1073741670)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))))) [2018-11-18 11:41:00,442 INFO L425 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-11-18 11:41:00,442 INFO L425 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-11-18 11:41:00,442 INFO L421 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,442 INFO L425 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-11-18 11:41:00,442 INFO L421 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-18 11:41:00,442 INFO L425 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-11-18 11:41:00,442 INFO L425 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-11-18 11:41:00,442 INFO L421 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-11-18 11:41:00,442 INFO L425 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-11-18 11:41:00,442 INFO L425 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-11-18 11:41:00,442 INFO L425 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-11-18 11:41:00,443 INFO L425 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-11-18 11:41:00,443 INFO L421 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse2 (+ ~DC~0 2)) (.cse0 (+ ~NP~0 2)) (.cse1 (+ ~NP~0 5)) (.cse3 (+ ~SKIP1~0 2)) (.cse4 (+ ~MPR3~0 1))) (let ((.cse5 (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse2 ~SKIP2~0) (and (<= .cse0 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse1 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse3 ~MPR1~0)) (<= .cse4 ~IPC~0)))) (or (or (< ~SKIP1~0 .cse0) (< ~MPR3~0 .cse1) (< ~SKIP2~0 .cse2) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse3) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4)) (and (= 0 CdAudio435DeviceControl_~status~6) .cse5) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse5)))) [2018-11-18 11:41:00,450 INFO L425 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-11-18 11:41:00,450 INFO L425 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-11-18 11:41:00,450 INFO L421 ceAbstractionStarter]: At program point L1378(line 1378) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-11-18 11:41:00,450 INFO L425 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-11-18 11:41:00,450 INFO L425 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-11-18 11:41:00,450 INFO L421 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,450 INFO L421 ceAbstractionStarter]: At program point L1015(lines 1014 1484) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,450 INFO L421 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse2 (+ ~DC~0 2)) (.cse0 (+ ~NP~0 2)) (.cse1 (+ ~NP~0 5)) (.cse3 (+ ~SKIP1~0 2)) (.cse4 (+ ~MPR3~0 1))) (let ((.cse5 (and (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse2 ~SKIP2~0) (and (<= .cse0 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse1 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse3 ~MPR1~0))) (<= .cse4 ~IPC~0)))) (or (or (< ~SKIP1~0 .cse0) (< ~MPR3~0 .cse1) (< ~SKIP2~0 .cse2) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse3) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4)) (and (= 0 CdAudio435DeviceControl_~status~6) .cse5) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse5)))) [2018-11-18 11:41:00,451 INFO L425 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-11-18 11:41:00,451 INFO L425 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-11-18 11:41:00,457 INFO L421 ceAbstractionStarter]: At program point L1329(line 1329) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-11-18 11:41:00,457 INFO L421 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,457 INFO L425 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-11-18 11:41:00,458 INFO L425 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-11-18 11:41:00,458 INFO L425 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-11-18 11:41:00,458 INFO L425 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-11-18 11:41:00,458 INFO L425 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-11-18 11:41:00,458 INFO L421 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 1))) (or (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-11-18 11:41:00,458 INFO L421 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0))) [2018-11-18 11:41:00,458 INFO L425 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-11-18 11:41:00,458 INFO L425 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-11-18 11:41:00,458 INFO L421 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-11-18 11:41:00,467 INFO L421 ceAbstractionStarter]: At program point L1150(lines 1150 1151) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0))) [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-11-18 11:41:00,467 INFO L421 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-11-18 11:41:00,467 INFO L421 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-11-18 11:41:00,467 INFO L425 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-11-18 11:41:00,468 INFO L425 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-11-18 11:41:00,468 INFO L425 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-11-18 11:41:00,468 INFO L425 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-11-18 11:41:00,475 INFO L421 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,475 INFO L425 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-11-18 11:41:00,476 INFO L421 ceAbstractionStarter]: At program point L1317(line 1317) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) [2018-11-18 11:41:00,476 INFO L425 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-11-18 11:41:00,476 INFO L425 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-11-18 11:41:00,476 INFO L421 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,476 INFO L425 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-11-18 11:41:00,476 INFO L425 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-11-18 11:41:00,476 INFO L421 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,476 INFO L425 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-11-18 11:41:00,476 INFO L421 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,476 INFO L425 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-11-18 11:41:00,485 INFO L421 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L421 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)))) [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L421 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (let ((.cse0 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= .cse0 0) (<= 0 .cse0) (and (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|)))) [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-11-18 11:41:00,486 INFO L425 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-11-18 11:41:00,490 INFO L421 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 11:41:00,490 INFO L425 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-11-18 11:41:00,490 INFO L425 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-11-18 11:41:00,490 INFO L425 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-11-18 11:41:00,490 INFO L425 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L421 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 1))) (or (and .cse0 .cse1 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse0 .cse1 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L421 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-11-18 11:41:00,491 INFO L425 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L421 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= 0 CdAudio435DeviceControl_~status~6))) [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L421 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-11-18 11:41:00,498 INFO L425 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-11-18 11:41:00,499 INFO L425 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-11-18 11:41:00,499 INFO L425 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-11-18 11:41:00,499 INFO L425 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-11-18 11:41:00,499 INFO L425 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-11-18 11:41:00,499 INFO L425 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-11-18 11:41:00,499 INFO L421 ceAbstractionStarter]: At program point L1125(line 1125) the Hoare annotation is: (or (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 1 |old(~s~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1))) (and (= 0 ~pended~0) (= ~s~0 1))) [2018-11-18 11:41:00,499 INFO L425 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-11-18 11:41:00,499 INFO L425 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-11-18 11:41:00,506 INFO L428 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-11-18 11:41:00,506 INFO L425 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-11-18 11:41:00,506 INFO L425 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-11-18 11:41:00,506 INFO L425 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-11-18 11:41:00,506 INFO L425 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-11-18 11:41:00,506 INFO L425 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-11-18 11:41:00,506 INFO L421 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,507 INFO L425 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-11-18 11:41:00,507 INFO L425 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-11-18 11:41:00,507 INFO L425 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-11-18 11:41:00,507 INFO L421 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (or (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (not (= |old(~customIrp~0)| 0))) (and (= |old(~customIrp~0)| ~customIrp~0) (and (= 0 ~pended~0) (= ~routine~0 1) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)))) [2018-11-18 11:41:00,507 INFO L425 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-11-18 11:41:00,507 INFO L421 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,507 INFO L421 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:41:00,509 INFO L425 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-11-18 11:41:00,509 INFO L425 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-11-18 11:41:00,509 INFO L421 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse6 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse7 (= 0 ~pended~0)) (.cse9 (= ~routine~0 1)) (.cse10 (<= 1 ~setEventCalled~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse11 (<= ~setEventCalled~0 1)) (.cse12 (= |old(~customIrp~0)| ~customIrp~0))) (or (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= 0 |old(~routine~0)|)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~MPR3~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~compRegistered~0)| 0)))) (.cse1 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (< ~NP~0 1)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 (< .cse2 0) .cse4 .cse5)) (or .cse0 .cse1 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5))) (and (= ~s~0 ~MPR3~0) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (and (and .cse6 .cse7 .cse9 .cse10 (= ~s~0 1) .cse8 .cse11) .cse12) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:41:00,509 INFO L428 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-11-18 11:41:00,509 INFO L428 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-11-18 11:41:00,509 INFO L428 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-11-18 11:41:00,509 INFO L425 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-11-18 11:41:00,509 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-11-18 11:41:00,509 INFO L425 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-11-18 11:41:00,509 INFO L425 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-11-18 11:41:00,509 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-11-18 11:41:00,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:41:00 BoogieIcfgContainer [2018-11-18 11:41:00,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:41:00,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:41:00,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:41:00,576 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:41:00,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:40:02" (3/4) ... [2018-11-18 11:41:00,579 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:41:00,587 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-11-18 11:41:00,587 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 11:41:00,587 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-11-18 11:41:00,587 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-11-18 11:41:00,587 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:41:00,587 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-11-18 11:41:00,588 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 11:41:00,589 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-11-18 11:41:00,589 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 11:41:00,589 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-11-18 11:41:00,589 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:41:00,589 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-11-18 11:41:00,589 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-11-18 11:41:00,589 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-11-18 11:41:00,589 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-11-18 11:41:00,590 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-11-18 11:41:00,590 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-18 11:41:00,608 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2018-11-18 11:41:00,610 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-18 11:41:00,612 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 11:41:00,639 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || (((((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && NP + 5 <= MPR3) && routine == 0) && DC + 2 <= SKIP2) && NP <= 1) && lowerDriverReturn == status) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,640 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,640 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || ((((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,641 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) [2018-11-18 11:41:00,641 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))))) && ((((s == 1 && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0))) && ((((s == 1 && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || !(\old(customIrp) == 0)) [2018-11-18 11:41:00,641 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))))) && ((((s == 1 && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0))) && ((((s == 1 && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || !(\old(customIrp) == 0)) [2018-11-18 11:41:00,642 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) [2018-11-18 11:41:00,642 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) || !(\old(compRegistered) == 0)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,642 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) [2018-11-18 11:41:00,642 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) [2018-11-18 11:41:00,642 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && lowerDriverReturn == status) && MPR3 + 1 <= IPC)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,643 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && IPC == s) && routine == 0)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0) [2018-11-18 11:41:00,643 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))))) && (((((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || (((1 <= setEventCalled && s == 1) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0)) [2018-11-18 11:41:00,643 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-11-18 11:41:00,643 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 [2018-11-18 11:41:00,644 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 + 1 <= IPC)) && \old(customIrp) == customIrp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,644 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) [2018-11-18 11:41:00,644 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) [2018-11-18 11:41:00,651 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-18 11:41:00,652 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && s == 1) && setPagable <= 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,652 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-18 11:41:00,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-18 11:41:00,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) [2018-11-18 11:41:00,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) [2018-11-18 11:41:00,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-18 11:41:00,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) && ((0 < myStatus + 1073741637 || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) [2018-11-18 11:41:00,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) [2018-11-18 11:41:00,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == status && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) [2018-11-18 11:41:00,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) && ((0 < myStatus + 1073741637 || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) [2018-11-18 11:41:00,703 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((((0 <= status + 1073741670 && 0 == pended) && s == 1) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) [2018-11-18 11:41:00,705 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(customIrp) == customIrp && (((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && myStatus == \old(myStatus)) && 0 <= myStatus) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,705 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && \old(customIrp) == customIrp) && \old(myStatus) == myStatus) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) [2018-11-18 11:41:00,705 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-18 11:41:00,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == 1) [2018-11-18 11:41:00,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((0 == pended && s == 1) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && s == 1) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) [2018-11-18 11:41:00,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-18 11:41:00,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-18 11:41:00,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-18 11:41:00,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && s == 1) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-18 11:41:00,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-18 11:41:00,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-18 11:41:00,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-18 11:41:00,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-18 11:41:00,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-18 11:41:00,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-18 11:41:00,766 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && \old(s) == s) [2018-11-18 11:41:00,766 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) [2018-11-18 11:41:00,766 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-18 11:41:00,766 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-18 11:41:00,766 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-18 11:41:00,766 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) [2018-11-18 11:41:00,932 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_39a570e7-ecdd-4502-aac5-ffce3dca10af/bin-2019/uautomizer/witness.graphml [2018-11-18 11:41:00,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:41:00,932 INFO L168 Benchmark]: Toolchain (without parser) took 60213.27 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -302.0 MB). Peak memory consumption was 877.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:00,935 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:41:00,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:00,936 INFO L168 Benchmark]: Boogie Preprocessor took 65.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:00,936 INFO L168 Benchmark]: RCFGBuilder took 1124.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 144.5 MB). Peak memory consumption was 144.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:00,936 INFO L168 Benchmark]: TraceAbstraction took 58158.50 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 970.0 MB in the beginning and 1.3 GB in the end (delta: -341.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 11:41:00,936 INFO L168 Benchmark]: Witness Printer took 356.46 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:00,938 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1124.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 144.5 MB). Peak memory consumption was 144.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58158.50 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 970.0 MB in the beginning and 1.3 GB in the end (delta: -341.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 356.46 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: 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: 1756]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC) && 0 == pended && NP + 5 <= MPR3)) || !(\old(compRegistered) == 0)) || (((((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && lowerDriverReturn == status) && MPR3 + 1 <= IPC)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && 0 == pended && NP + 5 <= MPR3)) || !(\old(customIrp) == 0) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 1790]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || (((((((NP + 2 <= SKIP1 && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((s == NP && 0 == pended) && status + 1073741670 <= 0) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 2074]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1) - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1824]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || (((((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && IPC == s) && NP + 5 <= MPR3) && routine == 0) && DC + 2 <= SKIP2) && NP <= 1) && lowerDriverReturn == status) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && MPR3 + 1 <= IPC)) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || (((((DC == s && !(259 == status)) && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || ((((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1934]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (s == NP && 0 == pended) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: (((s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))))) && ((((s == 1 && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0))) && ((((s == 1 && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 2081]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) && ((0 < myStatus + 1073741637 || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((0 == pended && \old(s) == s) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) && ((0 < myStatus + 1073741637 || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: (((s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))))) && ((((s == 1 && \old(customIrp) == customIrp) || ((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0))) && ((((s == 1 && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == status && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC)) || (status + 1073741670 <= 0 && ((DC + 5 <= IPC && DC + 2 <= SKIP2) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 + 1 <= IPC) - InvariantResult [Line: 1785]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 + 1 <= IPC)) && \old(customIrp) == customIrp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1086]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && \old(s) == s) - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 1792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || myStatus + 1073741637 < 0) || IPC < MPR3 + 1) || 1 < \old(setEventCalled)) && ((((((((((SKIP1 < NP + 2 || NP < 1) || !(myStatus == 0)) || SKIP2 < DC + 2) || 1 < NP) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || 1 < \old(setEventCalled))) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && (s == 1 || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))))) && (((((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || !(myStatus == 0)) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled)) && (((((((IPC < SKIP2 + 3 || \old(setEventCalled) < 1) || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || IPC < MPR3 + 1) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5 || NP < \old(s)) || compRegistered < 1) || SKIP2 < DC + 2) || !(1 == routine)) || 1 < NP) || !(1 == \old(s))) || 1 < \old(setEventCalled))) || (((1 <= setEventCalled && s == 1) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0))) && (\old(customIrp) == customIrp || ((((IPC < SKIP2 + 3 || !(myStatus == 0)) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s))) && ((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || ((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || IPC < MPR3 + 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == \old(s)))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1842]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && SKIP2 <= s)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || ((((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (((s <= DC && DC + 5 <= IPC) && (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3 && lowerDriverReturn == status) || (((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC == s)) && DC + 2 <= SKIP2) && status + 1073741789 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) && (((((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || ((((((s == 1 && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && s + 2 <= SKIP1)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1)) && (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || NP < 1) || SKIP2 < DC + 2) || 1 < NP) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) && (((((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && 1 <= setEventCalled) && 0 <= __cil_tmp8 + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && setEventCalled <= 1) || (((((IPC < SKIP2 + 3 || !(myStatus == 0)) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))) && (((((IPC < SKIP2 + 3 || 0 < myStatus + 1073741637) || myStatus + 1073741637 < 0) || (((((((MPR3 < NP + 5 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || MPR1 < SKIP1 + 2) || !(0 == \old(pended))) || IPC < MPR3 + 1) || compRegistered < 1) || NP < \old(s)) || 1 < NP) || !(1 == \old(s))))) || !(customIrp == 0)) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((0 == pended && s == 1) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && IPC == s) && routine == 0)) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((lowerDriverReturn == status && 1 <= compRegistered) && IPC == s) && routine == 0) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((\old(customIrp) == customIrp && (((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && myStatus == \old(myStatus)) && 0 <= myStatus) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((((0 == pended && s == 1) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && s == 1) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) - InvariantResult [Line: 2079]: Loop Invariant Derived loop invariant: (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == SKIP1)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == \old(pended))) || SKIP2 < DC + 2 - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || (0 == pended && s == 1) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && myStatus + 1073741637 <= 0) && MPR3 + 1 <= IPC)) || !(\old(compRegistered) == 0)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == 1) && SKIP1 + 2 <= MPR1) && s <= NP) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP <= 1) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || ((0 == pended && s == 1) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || ((((0 <= status + 1073741670 && 0 == pended) && s == 1) && myStatus == \old(myStatus)) && status + 1073741670 <= 0) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) || (0 == pended && s == 1) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((0 == pended && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && s == 1) && setPagable <= 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 2133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1832]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || (((0 == status && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && !(259 == status)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && MPR3 + 1 <= IPC)) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741789 <= 0) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((NP + 2 <= SKIP1 && 1 <= NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && NP <= 1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s) && MPR3 + 1 <= IPC)) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && \old(customIrp) == customIrp) && \old(myStatus) == myStatus) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && s == 1) && routine == 0) && myStatus == \old(myStatus)) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) || ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1) && ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < MPR3 + 1)) - InvariantResult [Line: 2050]: Loop Invariant Derived loop invariant: ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || (0 == pended && s == SKIP1)) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 535 locations, 1 error locations. SAFE Result, 58.0s OverallTime, 95 OverallIterations, 2 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 27.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 49836 SDtfs, 20440 SDslu, 223932 SDs, 0 SdLazy, 22940 SolverSat, 3557 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 336 SyntacticMatches, 9 SemanticMatches, 753 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=948occurred in iteration=15, 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: 3.9s AutomataMinimizationTime, 95 MinimizatonAttempts, 2822 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1805 PreInvPairs, 2182 NumberOfFragments, 24525 HoareAnnotationTreeSize, 1805 FomulaSimplifications, 83782865 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 171 FomulaSimplificationsInter, 2676044 FormulaSimplificationTreeSizeReductionInter, 25.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 6380 NumberOfCodeBlocks, 6380 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 6284 ConstructedInterpolants, 0 QuantifiedInterpolants, 898406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 96 InterpolantComputations, 95 PerfectInterpolantSequences, 68/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...