./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/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_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/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-1dbac8b [2018-11-10 01:49:49,340 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:49:49,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:49:49,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:49:49,348 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:49:49,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:49:49,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:49:49,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:49:49,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:49:49,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:49:49,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:49:49,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:49:49,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:49:49,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:49:49,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:49:49,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:49:49,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:49:49,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:49:49,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:49:49,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:49:49,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:49:49,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:49:49,363 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:49:49,363 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:49:49,363 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:49:49,364 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:49:49,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:49:49,365 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:49:49,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:49:49,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:49:49,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:49:49,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:49:49,367 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:49:49,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:49:49,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:49:49,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:49:49,368 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 01:49:49,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:49:49,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:49:49,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:49:49,379 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 01:49:49,379 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:49:49,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:49:49,380 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:49:49,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:49:49,380 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:49:49,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:49:49,380 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:49:49,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:49:49,381 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:49:49,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:49:49,381 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:49:49,381 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:49:49,381 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:49:49,381 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:49:49,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:49:49,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:49:49,382 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:49:49,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:49:49,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:49:49,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:49:49,382 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:49:49,382 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:49:49,382 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:49:49,382 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:49:49,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 01:49:49,383 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_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/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-10 01:49:49,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:49:49,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:49:49,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:49:49,418 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:49:49,418 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:49:49,419 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 01:49:49,454 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/data/5c481e761/243165df48414be2bf8cfa5913a0c6d9/FLAG395b4a3cf [2018-11-10 01:49:49,815 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:49:49,816 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 01:49:49,828 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/data/5c481e761/243165df48414be2bf8cfa5913a0c6d9/FLAG395b4a3cf [2018-11-10 01:49:49,837 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/data/5c481e761/243165df48414be2bf8cfa5913a0c6d9 [2018-11-10 01:49:49,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:49:49,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 01:49:49,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:49:49,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:49:49,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:49:49,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:49:49" (1/1) ... [2018-11-10 01:49:49,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ad4d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:49, skipping insertion in model container [2018-11-10 01:49:49,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:49:49" (1/1) ... [2018-11-10 01:49:49,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:49:49,889 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:49:50,136 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:49:50,140 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:49:50,213 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:49:50,231 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:49:50,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50 WrapperNode [2018-11-10 01:49:50,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:49:50,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:49:50,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:49:50,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:49:50,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (1/1) ... [2018-11-10 01:49:50,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (1/1) ... [2018-11-10 01:49:50,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (1/1) ... [2018-11-10 01:49:50,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (1/1) ... [2018-11-10 01:49:50,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (1/1) ... [2018-11-10 01:49:50,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (1/1) ... [2018-11-10 01:49:50,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (1/1) ... [2018-11-10 01:49:50,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:49:50,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:49:50,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:49:50,349 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:49:50,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/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-10 01:49:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:49:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:49:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-10 01:49:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-10 01:49:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-10 01:49:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-10 01:49:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-10 01:49:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-10 01:49:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-10 01:49:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-10 01:49:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-10 01:49:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-10 01:49:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-10 01:49:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-10 01:49:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:49:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-10 01:49:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-10 01:49:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-10 01:49:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-10 01:49:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-10 01:49:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-10 01:49:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-10 01:49:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 01:49:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 01:49:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 01:49:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-10 01:49:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-10 01:49:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-10 01:49:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:49:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:49:50,735 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:50,735 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:50,815 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:50,815 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:50,875 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:50,875 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:50,951 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:50,951 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:51,003 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:51,003 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:51,130 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:51,130 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:51,163 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:51,164 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:51,184 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:51,184 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:51,318 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:49:51,318 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:49:51,331 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:49:51,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:49:51 BoogieIcfgContainer [2018-11-10 01:49:51,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:49:51,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:49:51,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:49:51,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:49:51,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:49:49" (1/3) ... [2018-11-10 01:49:51,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0f8a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:49:51, skipping insertion in model container [2018-11-10 01:49:51,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:50" (2/3) ... [2018-11-10 01:49:51,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0f8a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:49:51, skipping insertion in model container [2018-11-10 01:49:51,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:49:51" (3/3) ... [2018-11-10 01:49:51,337 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 01:49:51,343 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:49:51,349 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:49:51,360 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:49:51,383 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:49:51,384 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:49:51,384 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:49:51,384 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:49:51,384 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:49:51,384 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:49:51,384 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:49:51,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:49:51,385 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:49:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states. [2018-11-10 01:49:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 01:49:51,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:51,411 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-10 01:49:51,413 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:51,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash -545325625, now seen corresponding path program 1 times [2018-11-10 01:49:51,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:51,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:51,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:51,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:51,596 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-10 01:49:51,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:51,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:51,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:51,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:51,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:51,611 INFO L87 Difference]: Start difference. First operand 516 states. Second operand 3 states. [2018-11-10 01:49:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:51,780 INFO L93 Difference]: Finished difference Result 889 states and 1375 transitions. [2018-11-10 01:49:51,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:51,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 01:49:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:51,794 INFO L225 Difference]: With dead ends: 889 [2018-11-10 01:49:51,794 INFO L226 Difference]: Without dead ends: 508 [2018-11-10 01:49:51,800 INFO L605 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-10 01:49:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-11-10 01:49:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-11-10 01:49:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-10 01:49:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 738 transitions. [2018-11-10 01:49:51,864 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 738 transitions. Word has length 20 [2018-11-10 01:49:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:51,864 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 738 transitions. [2018-11-10 01:49:51,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 738 transitions. [2018-11-10 01:49:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 01:49:51,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:51,866 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-10 01:49:51,866 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:51,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash 736354971, now seen corresponding path program 1 times [2018-11-10 01:49:51,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:51,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:51,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:51,975 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-10 01:49:51,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:51,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:51,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:51,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:51,978 INFO L87 Difference]: Start difference. First operand 508 states and 738 transitions. Second operand 3 states. [2018-11-10 01:49:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:52,191 INFO L93 Difference]: Finished difference Result 792 states and 1120 transitions. [2018-11-10 01:49:52,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:52,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 01:49:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:52,197 INFO L225 Difference]: With dead ends: 792 [2018-11-10 01:49:52,197 INFO L226 Difference]: Without dead ends: 672 [2018-11-10 01:49:52,199 INFO L605 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-10 01:49:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-11-10 01:49:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 654. [2018-11-10 01:49:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-11-10 01:49:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 933 transitions. [2018-11-10 01:49:52,230 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 933 transitions. Word has length 25 [2018-11-10 01:49:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:52,233 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 933 transitions. [2018-11-10 01:49:52,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 933 transitions. [2018-11-10 01:49:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 01:49:52,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:52,234 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-10 01:49:52,234 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:52,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:52,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1750587816, now seen corresponding path program 1 times [2018-11-10 01:49:52,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:52,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:52,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:52,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:52,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:52,289 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-10 01:49:52,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:52,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:52,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:52,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:52,293 INFO L87 Difference]: Start difference. First operand 654 states and 933 transitions. Second operand 3 states. [2018-11-10 01:49:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:52,345 INFO L93 Difference]: Finished difference Result 999 states and 1382 transitions. [2018-11-10 01:49:52,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:52,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 01:49:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:52,350 INFO L225 Difference]: With dead ends: 999 [2018-11-10 01:49:52,351 INFO L226 Difference]: Without dead ends: 823 [2018-11-10 01:49:52,351 INFO L605 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-10 01:49:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-11-10 01:49:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 771. [2018-11-10 01:49:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-11-10 01:49:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1095 transitions. [2018-11-10 01:49:52,386 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1095 transitions. Word has length 30 [2018-11-10 01:49:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:52,386 INFO L481 AbstractCegarLoop]: Abstraction has 771 states and 1095 transitions. [2018-11-10 01:49:52,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1095 transitions. [2018-11-10 01:49:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 01:49:52,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:52,388 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-10 01:49:52,388 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:52,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:52,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1290288367, now seen corresponding path program 1 times [2018-11-10 01:49:52,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:52,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:52,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:52,437 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-10 01:49:52,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:52,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:52,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:52,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:52,439 INFO L87 Difference]: Start difference. First operand 771 states and 1095 transitions. Second operand 3 states. [2018-11-10 01:49:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:52,617 INFO L93 Difference]: Finished difference Result 1436 states and 2104 transitions. [2018-11-10 01:49:52,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:52,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 01:49:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:52,622 INFO L225 Difference]: With dead ends: 1436 [2018-11-10 01:49:52,622 INFO L226 Difference]: Without dead ends: 1168 [2018-11-10 01:49:52,623 INFO L605 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-10 01:49:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-11-10 01:49:52,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 907. [2018-11-10 01:49:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-10 01:49:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1331 transitions. [2018-11-10 01:49:52,655 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1331 transitions. Word has length 31 [2018-11-10 01:49:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:52,655 INFO L481 AbstractCegarLoop]: Abstraction has 907 states and 1331 transitions. [2018-11-10 01:49:52,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1331 transitions. [2018-11-10 01:49:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 01:49:52,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:52,657 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-10 01:49:52,657 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:52,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1105841973, now seen corresponding path program 1 times [2018-11-10 01:49:52,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:52,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:52,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:52,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:52,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:52,725 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-10 01:49:52,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:52,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:49:52,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:49:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:49:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:49:52,726 INFO L87 Difference]: Start difference. First operand 907 states and 1331 transitions. Second operand 5 states. [2018-11-10 01:49:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:53,199 INFO L93 Difference]: Finished difference Result 1574 states and 2317 transitions. [2018-11-10 01:49:53,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:49:53,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-10 01:49:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:53,204 INFO L225 Difference]: With dead ends: 1574 [2018-11-10 01:49:53,204 INFO L226 Difference]: Without dead ends: 992 [2018-11-10 01:49:53,206 INFO L605 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-10 01:49:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-10 01:49:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 895. [2018-11-10 01:49:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-10 01:49:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1307 transitions. [2018-11-10 01:49:53,240 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1307 transitions. Word has length 32 [2018-11-10 01:49:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:53,241 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1307 transitions. [2018-11-10 01:49:53,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:49:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1307 transitions. [2018-11-10 01:49:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 01:49:53,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:53,242 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-10 01:49:53,243 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:53,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1683321273, now seen corresponding path program 1 times [2018-11-10 01:49:53,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:53,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:53,286 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-10 01:49:53,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:53,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:53,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:53,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:53,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:53,287 INFO L87 Difference]: Start difference. First operand 895 states and 1307 transitions. Second operand 3 states. [2018-11-10 01:49:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:53,341 INFO L93 Difference]: Finished difference Result 898 states and 1309 transitions. [2018-11-10 01:49:53,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:53,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 01:49:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:53,344 INFO L225 Difference]: With dead ends: 898 [2018-11-10 01:49:53,344 INFO L226 Difference]: Without dead ends: 894 [2018-11-10 01:49:53,344 INFO L605 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-10 01:49:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-11-10 01:49:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2018-11-10 01:49:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-10 01:49:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1304 transitions. [2018-11-10 01:49:53,372 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1304 transitions. Word has length 36 [2018-11-10 01:49:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:53,372 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1304 transitions. [2018-11-10 01:49:53,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1304 transitions. [2018-11-10 01:49:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 01:49:53,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:53,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] [2018-11-10 01:49:53,374 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:53,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:53,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2048377982, now seen corresponding path program 1 times [2018-11-10 01:49:53,374 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:53,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:53,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:53,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:53,411 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-10 01:49:53,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:53,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:53,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:53,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:53,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:53,412 INFO L87 Difference]: Start difference. First operand 894 states and 1304 transitions. Second operand 3 states. [2018-11-10 01:49:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:53,455 INFO L93 Difference]: Finished difference Result 1286 states and 1827 transitions. [2018-11-10 01:49:53,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:53,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-10 01:49:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:53,458 INFO L225 Difference]: With dead ends: 1286 [2018-11-10 01:49:53,458 INFO L226 Difference]: Without dead ends: 1023 [2018-11-10 01:49:53,459 INFO L605 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-10 01:49:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-11-10 01:49:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 880. [2018-11-10 01:49:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-10 01:49:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1246 transitions. [2018-11-10 01:49:53,486 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1246 transitions. Word has length 39 [2018-11-10 01:49:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:53,487 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1246 transitions. [2018-11-10 01:49:53,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1246 transitions. [2018-11-10 01:49:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 01:49:53,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:53,488 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-10 01:49:53,488 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:53,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1893485112, now seen corresponding path program 1 times [2018-11-10 01:49:53,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:53,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:53,534 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-10 01:49:53,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:53,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:53,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:53,535 INFO L87 Difference]: Start difference. First operand 880 states and 1246 transitions. Second operand 3 states. [2018-11-10 01:49:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:53,569 INFO L93 Difference]: Finished difference Result 980 states and 1370 transitions. [2018-11-10 01:49:53,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:53,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 01:49:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:53,572 INFO L225 Difference]: With dead ends: 980 [2018-11-10 01:49:53,572 INFO L226 Difference]: Without dead ends: 962 [2018-11-10 01:49:53,573 INFO L605 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-10 01:49:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-11-10 01:49:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 900. [2018-11-10 01:49:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-10 01:49:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1272 transitions. [2018-11-10 01:49:53,604 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1272 transitions. Word has length 40 [2018-11-10 01:49:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:53,604 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 1272 transitions. [2018-11-10 01:49:53,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1272 transitions. [2018-11-10 01:49:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 01:49:53,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:53,606 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-10 01:49:53,607 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:53,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1084160267, now seen corresponding path program 1 times [2018-11-10 01:49:53,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:53,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:53,650 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-10 01:49:53,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:53,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:53,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:53,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:53,651 INFO L87 Difference]: Start difference. First operand 900 states and 1272 transitions. Second operand 3 states. [2018-11-10 01:49:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:53,704 INFO L93 Difference]: Finished difference Result 1179 states and 1651 transitions. [2018-11-10 01:49:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:53,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-10 01:49:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:53,707 INFO L225 Difference]: With dead ends: 1179 [2018-11-10 01:49:53,707 INFO L226 Difference]: Without dead ends: 933 [2018-11-10 01:49:53,708 INFO L605 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-10 01:49:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-11-10 01:49:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2018-11-10 01:49:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-10 01:49:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1271 transitions. [2018-11-10 01:49:53,743 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1271 transitions. Word has length 46 [2018-11-10 01:49:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:53,743 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 1271 transitions. [2018-11-10 01:49:53,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1271 transitions. [2018-11-10 01:49:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 01:49:53,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:53,745 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-10 01:49:53,746 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:53,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2092414536, now seen corresponding path program 1 times [2018-11-10 01:49:53,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:53,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:53,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:53,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:53,794 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-10 01:49:53,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:53,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:49:53,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:49:53,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:49:53,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:49:53,795 INFO L87 Difference]: Start difference. First operand 900 states and 1271 transitions. Second operand 4 states. [2018-11-10 01:49:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:54,022 INFO L93 Difference]: Finished difference Result 1022 states and 1417 transitions. [2018-11-10 01:49:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:49:54,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-10 01:49:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:54,025 INFO L225 Difference]: With dead ends: 1022 [2018-11-10 01:49:54,025 INFO L226 Difference]: Without dead ends: 789 [2018-11-10 01:49:54,026 INFO L605 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-10 01:49:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-11-10 01:49:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 755. [2018-11-10 01:49:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-11-10 01:49:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1060 transitions. [2018-11-10 01:49:54,052 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1060 transitions. Word has length 47 [2018-11-10 01:49:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:54,052 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 1060 transitions. [2018-11-10 01:49:54,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:49:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1060 transitions. [2018-11-10 01:49:54,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 01:49:54,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:54,053 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-10 01:49:54,053 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:54,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:54,054 INFO L82 PathProgramCache]: Analyzing trace with hash -95752597, now seen corresponding path program 1 times [2018-11-10 01:49:54,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:54,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:54,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:54,081 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-10 01:49:54,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:54,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:54,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:54,082 INFO L87 Difference]: Start difference. First operand 755 states and 1060 transitions. Second operand 3 states. [2018-11-10 01:49:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:54,114 INFO L93 Difference]: Finished difference Result 875 states and 1208 transitions. [2018-11-10 01:49:54,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:54,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-10 01:49:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:54,117 INFO L225 Difference]: With dead ends: 875 [2018-11-10 01:49:54,117 INFO L226 Difference]: Without dead ends: 779 [2018-11-10 01:49:54,118 INFO L605 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-10 01:49:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-10 01:49:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 754. [2018-11-10 01:49:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-10 01:49:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1055 transitions. [2018-11-10 01:49:54,143 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1055 transitions. Word has length 47 [2018-11-10 01:49:54,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:54,144 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 1055 transitions. [2018-11-10 01:49:54,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1055 transitions. [2018-11-10 01:49:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 01:49:54,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:54,145 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-10 01:49:54,145 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:54,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1151602405, now seen corresponding path program 1 times [2018-11-10 01:49:54,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:54,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:54,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:54,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:54,174 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-10 01:49:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:54,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:54,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:54,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:54,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:54,175 INFO L87 Difference]: Start difference. First operand 754 states and 1055 transitions. Second operand 3 states. [2018-11-10 01:49:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:54,252 INFO L93 Difference]: Finished difference Result 944 states and 1304 transitions. [2018-11-10 01:49:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:54,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 01:49:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:54,255 INFO L225 Difference]: With dead ends: 944 [2018-11-10 01:49:54,255 INFO L226 Difference]: Without dead ends: 934 [2018-11-10 01:49:54,256 INFO L605 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-10 01:49:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-11-10 01:49:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 829. [2018-11-10 01:49:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-11-10 01:49:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1142 transitions. [2018-11-10 01:49:54,285 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1142 transitions. Word has length 48 [2018-11-10 01:49:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:54,285 INFO L481 AbstractCegarLoop]: Abstraction has 829 states and 1142 transitions. [2018-11-10 01:49:54,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1142 transitions. [2018-11-10 01:49:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 01:49:54,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:54,287 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-10 01:49:54,287 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:54,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1783806924, now seen corresponding path program 1 times [2018-11-10 01:49:54,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:54,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:54,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:54,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:54,336 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-10 01:49:54,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:54,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 01:49:54,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 01:49:54,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 01:49:54,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:49:54,337 INFO L87 Difference]: Start difference. First operand 829 states and 1142 transitions. Second operand 8 states. [2018-11-10 01:49:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:54,430 INFO L93 Difference]: Finished difference Result 855 states and 1176 transitions. [2018-11-10 01:49:54,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:49:54,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-10 01:49:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:54,433 INFO L225 Difference]: With dead ends: 855 [2018-11-10 01:49:54,433 INFO L226 Difference]: Without dead ends: 851 [2018-11-10 01:49:54,434 INFO L605 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-10 01:49:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-10 01:49:54,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 848. [2018-11-10 01:49:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-11-10 01:49:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1169 transitions. [2018-11-10 01:49:54,464 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1169 transitions. Word has length 49 [2018-11-10 01:49:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:54,465 INFO L481 AbstractCegarLoop]: Abstraction has 848 states and 1169 transitions. [2018-11-10 01:49:54,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 01:49:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1169 transitions. [2018-11-10 01:49:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 01:49:54,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:54,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] [2018-11-10 01:49:54,467 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:54,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1783530094, now seen corresponding path program 1 times [2018-11-10 01:49:54,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:54,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:54,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:54,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:54,525 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-10 01:49:54,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:54,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 01:49:54,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 01:49:54,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 01:49:54,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:49:54,526 INFO L87 Difference]: Start difference. First operand 848 states and 1169 transitions. Second operand 8 states. [2018-11-10 01:49:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:54,592 INFO L93 Difference]: Finished difference Result 890 states and 1221 transitions. [2018-11-10 01:49:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:49:54,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-10 01:49:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:54,595 INFO L225 Difference]: With dead ends: 890 [2018-11-10 01:49:54,595 INFO L226 Difference]: Without dead ends: 869 [2018-11-10 01:49:54,596 INFO L605 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-10 01:49:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-10 01:49:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 868. [2018-11-10 01:49:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-11-10 01:49:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1193 transitions. [2018-11-10 01:49:54,626 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1193 transitions. Word has length 49 [2018-11-10 01:49:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:54,626 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 1193 transitions. [2018-11-10 01:49:54,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 01:49:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1193 transitions. [2018-11-10 01:49:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 01:49:54,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:54,628 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:54,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1751655904, now seen corresponding path program 1 times [2018-11-10 01:49:54,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:54,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:54,653 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-10 01:49:54,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:54,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:54,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:54,654 INFO L87 Difference]: Start difference. First operand 868 states and 1193 transitions. Second operand 3 states. [2018-11-10 01:49:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:54,744 INFO L93 Difference]: Finished difference Result 1087 states and 1478 transitions. [2018-11-10 01:49:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:54,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-10 01:49:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:54,748 INFO L225 Difference]: With dead ends: 1087 [2018-11-10 01:49:54,748 INFO L226 Difference]: Without dead ends: 1055 [2018-11-10 01:49:54,748 INFO L605 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-10 01:49:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-11-10 01:49:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 948. [2018-11-10 01:49:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-11-10 01:49:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1285 transitions. [2018-11-10 01:49:54,785 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1285 transitions. Word has length 50 [2018-11-10 01:49:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:54,785 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 1285 transitions. [2018-11-10 01:49:54,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1285 transitions. [2018-11-10 01:49:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 01:49:54,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:54,787 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-10 01:49:54,787 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:54,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:54,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1898348706, now seen corresponding path program 1 times [2018-11-10 01:49:54,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:54,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:54,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:54,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:54,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-10 01:49:54,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:54,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 01:49:54,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 01:49:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 01:49:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:49:54,837 INFO L87 Difference]: Start difference. First operand 948 states and 1285 transitions. Second operand 7 states. [2018-11-10 01:49:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:55,486 INFO L93 Difference]: Finished difference Result 1114 states and 1559 transitions. [2018-11-10 01:49:55,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:49:55,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-10 01:49:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:55,489 INFO L225 Difference]: With dead ends: 1114 [2018-11-10 01:49:55,489 INFO L226 Difference]: Without dead ends: 1020 [2018-11-10 01:49:55,490 INFO L605 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-10 01:49:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-11-10 01:49:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 878. [2018-11-10 01:49:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-11-10 01:49:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1184 transitions. [2018-11-10 01:49:55,526 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1184 transitions. Word has length 50 [2018-11-10 01:49:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:55,526 INFO L481 AbstractCegarLoop]: Abstraction has 878 states and 1184 transitions. [2018-11-10 01:49:55,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 01:49:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1184 transitions. [2018-11-10 01:49:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 01:49:55,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:55,528 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-10 01:49:55,528 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:55,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1307715265, now seen corresponding path program 1 times [2018-11-10 01:49:55,529 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:55,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:55,600 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-10 01:49:55,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:55,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:49:55,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:49:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:49:55,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:49:55,601 INFO L87 Difference]: Start difference. First operand 878 states and 1184 transitions. Second operand 9 states. [2018-11-10 01:49:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:56,776 INFO L93 Difference]: Finished difference Result 1192 states and 1644 transitions. [2018-11-10 01:49:56,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:49:56,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-10 01:49:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:56,780 INFO L225 Difference]: With dead ends: 1192 [2018-11-10 01:49:56,780 INFO L226 Difference]: Without dead ends: 1123 [2018-11-10 01:49:56,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-10 01:49:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-10 01:49:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 891. [2018-11-10 01:49:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-11-10 01:49:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1209 transitions. [2018-11-10 01:49:56,836 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1209 transitions. Word has length 50 [2018-11-10 01:49:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:56,836 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1209 transitions. [2018-11-10 01:49:56,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:49:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1209 transitions. [2018-11-10 01:49:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 01:49:56,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:56,838 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-10 01:49:56,839 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:56,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash -212723345, now seen corresponding path program 1 times [2018-11-10 01:49:56,839 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:56,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:56,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:56,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:56,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:56,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:56,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:56,871 INFO L87 Difference]: Start difference. First operand 891 states and 1209 transitions. Second operand 3 states. [2018-11-10 01:49:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:56,933 INFO L93 Difference]: Finished difference Result 916 states and 1237 transitions. [2018-11-10 01:49:56,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:56,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-10 01:49:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:56,936 INFO L225 Difference]: With dead ends: 916 [2018-11-10 01:49:56,936 INFO L226 Difference]: Without dead ends: 911 [2018-11-10 01:49:56,936 INFO L605 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-10 01:49:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-11-10 01:49:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 907. [2018-11-10 01:49:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-10 01:49:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1228 transitions. [2018-11-10 01:49:56,971 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1228 transitions. Word has length 52 [2018-11-10 01:49:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:56,971 INFO L481 AbstractCegarLoop]: Abstraction has 907 states and 1228 transitions. [2018-11-10 01:49:56,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1228 transitions. [2018-11-10 01:49:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 01:49:56,973 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:56,973 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-10 01:49:56,973 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:56,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1458849901, now seen corresponding path program 1 times [2018-11-10 01:49:56,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:56,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:56,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:57,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-10 01:49:57,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:57,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:49:57,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:49:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:49:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:49:57,007 INFO L87 Difference]: Start difference. First operand 907 states and 1228 transitions. Second operand 3 states. [2018-11-10 01:49:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:57,075 INFO L93 Difference]: Finished difference Result 1123 states and 1518 transitions. [2018-11-10 01:49:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:49:57,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-10 01:49:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:57,078 INFO L225 Difference]: With dead ends: 1123 [2018-11-10 01:49:57,078 INFO L226 Difference]: Without dead ends: 879 [2018-11-10 01:49:57,079 INFO L605 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-10 01:49:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-10 01:49:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2018-11-10 01:49:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-10 01:49:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1191 transitions. [2018-11-10 01:49:57,112 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1191 transitions. Word has length 54 [2018-11-10 01:49:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:57,112 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1191 transitions. [2018-11-10 01:49:57,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:49:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1191 transitions. [2018-11-10 01:49:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 01:49:57,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:57,114 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-10 01:49:57,114 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:57,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1855862492, now seen corresponding path program 1 times [2018-11-10 01:49:57,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:57,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:57,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:57,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:57,164 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-10 01:49:57,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:57,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:49:57,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:49:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:49:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:49:57,165 INFO L87 Difference]: Start difference. First operand 879 states and 1191 transitions. Second operand 5 states. [2018-11-10 01:49:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:57,505 INFO L93 Difference]: Finished difference Result 889 states and 1199 transitions. [2018-11-10 01:49:57,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:49:57,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-10 01:49:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:57,509 INFO L225 Difference]: With dead ends: 889 [2018-11-10 01:49:57,509 INFO L226 Difference]: Without dead ends: 883 [2018-11-10 01:49:57,510 INFO L605 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-10 01:49:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-11-10 01:49:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 879. [2018-11-10 01:49:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-10 01:49:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1190 transitions. [2018-11-10 01:49:57,570 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1190 transitions. Word has length 53 [2018-11-10 01:49:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:57,571 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1190 transitions. [2018-11-10 01:49:57,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:49:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1190 transitions. [2018-11-10 01:49:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 01:49:57,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:57,574 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-10 01:49:57,575 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:57,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash -14681562, now seen corresponding path program 1 times [2018-11-10 01:49:57,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:57,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:57,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:57,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:57,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:57,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-10 01:49:57,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:57,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:49:57,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:49:57,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:49:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:49:57,614 INFO L87 Difference]: Start difference. First operand 879 states and 1190 transitions. Second operand 5 states. [2018-11-10 01:49:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:58,060 INFO L93 Difference]: Finished difference Result 891 states and 1201 transitions. [2018-11-10 01:49:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:49:58,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-10 01:49:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:58,064 INFO L225 Difference]: With dead ends: 891 [2018-11-10 01:49:58,064 INFO L226 Difference]: Without dead ends: 855 [2018-11-10 01:49:58,065 INFO L605 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-10 01:49:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-11-10 01:49:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 851. [2018-11-10 01:49:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-10 01:49:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1158 transitions. [2018-11-10 01:49:58,118 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1158 transitions. Word has length 52 [2018-11-10 01:49:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:58,118 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1158 transitions. [2018-11-10 01:49:58,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:49:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1158 transitions. [2018-11-10 01:49:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 01:49:58,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:58,121 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-10 01:49:58,121 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:58,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1965789300, now seen corresponding path program 1 times [2018-11-10 01:49:58,121 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:58,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:58,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:58,184 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-10 01:49:58,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:58,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:49:58,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:49:58,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:49:58,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:49:58,185 INFO L87 Difference]: Start difference. First operand 851 states and 1158 transitions. Second operand 5 states. [2018-11-10 01:49:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:58,594 INFO L93 Difference]: Finished difference Result 859 states and 1164 transitions. [2018-11-10 01:49:58,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:49:58,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-10 01:49:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:58,599 INFO L225 Difference]: With dead ends: 859 [2018-11-10 01:49:58,599 INFO L226 Difference]: Without dead ends: 853 [2018-11-10 01:49:58,599 INFO L605 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-10 01:49:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-10 01:49:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 851. [2018-11-10 01:49:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-10 01:49:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1157 transitions. [2018-11-10 01:49:58,668 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1157 transitions. Word has length 54 [2018-11-10 01:49:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:58,668 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1157 transitions. [2018-11-10 01:49:58,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:49:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1157 transitions. [2018-11-10 01:49:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 01:49:58,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:58,671 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-10 01:49:58,671 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:58,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1122077901, now seen corresponding path program 1 times [2018-11-10 01:49:58,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:58,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:58,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:58,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:58,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:58,771 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-10 01:49:58,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:58,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:49:58,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:49:58,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:49:58,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:49:58,772 INFO L87 Difference]: Start difference. First operand 851 states and 1157 transitions. Second operand 4 states. [2018-11-10 01:49:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:58,904 INFO L93 Difference]: Finished difference Result 890 states and 1198 transitions. [2018-11-10 01:49:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:49:58,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-10 01:49:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:58,907 INFO L225 Difference]: With dead ends: 890 [2018-11-10 01:49:58,907 INFO L226 Difference]: Without dead ends: 858 [2018-11-10 01:49:58,907 INFO L605 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-10 01:49:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-10 01:49:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 853. [2018-11-10 01:49:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-11-10 01:49:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1159 transitions. [2018-11-10 01:49:58,963 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1159 transitions. Word has length 55 [2018-11-10 01:49:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:58,963 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1159 transitions. [2018-11-10 01:49:58,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:49:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1159 transitions. [2018-11-10 01:49:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 01:49:58,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:58,965 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-10 01:49:58,965 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:58,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:58,966 INFO L82 PathProgramCache]: Analyzing trace with hash 612604811, now seen corresponding path program 1 times [2018-11-10 01:49:58,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:58,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:58,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:58,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:59,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-10 01:49:59,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:59,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:49:59,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:49:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:49:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:49:59,066 INFO L87 Difference]: Start difference. First operand 853 states and 1159 transitions. Second operand 9 states. [2018-11-10 01:49:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:59,283 INFO L93 Difference]: Finished difference Result 880 states and 1189 transitions. [2018-11-10 01:49:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:49:59,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-10 01:49:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:59,286 INFO L225 Difference]: With dead ends: 880 [2018-11-10 01:49:59,286 INFO L226 Difference]: Without dead ends: 842 [2018-11-10 01:49:59,287 INFO L605 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-10 01:49:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-11-10 01:49:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2018-11-10 01:49:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-11-10 01:49:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1133 transitions. [2018-11-10 01:49:59,339 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1133 transitions. Word has length 55 [2018-11-10 01:49:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:59,339 INFO L481 AbstractCegarLoop]: Abstraction has 842 states and 1133 transitions. [2018-11-10 01:49:59,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:49:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1133 transitions. [2018-11-10 01:49:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 01:49:59,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:59,344 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-10 01:49:59,344 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:59,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 651629811, now seen corresponding path program 1 times [2018-11-10 01:49:59,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:59,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:59,458 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-10 01:49:59,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:59,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:49:59,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:49:59,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:49:59,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:49:59,459 INFO L87 Difference]: Start difference. First operand 842 states and 1133 transitions. Second operand 10 states. [2018-11-10 01:49:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:59,640 INFO L93 Difference]: Finished difference Result 858 states and 1150 transitions. [2018-11-10 01:49:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 01:49:59,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-10 01:49:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:59,644 INFO L225 Difference]: With dead ends: 858 [2018-11-10 01:49:59,644 INFO L226 Difference]: Without dead ends: 840 [2018-11-10 01:49:59,644 INFO L605 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-10 01:49:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-10 01:49:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2018-11-10 01:49:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-10 01:49:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1129 transitions. [2018-11-10 01:49:59,697 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1129 transitions. Word has length 55 [2018-11-10 01:49:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:59,698 INFO L481 AbstractCegarLoop]: Abstraction has 840 states and 1129 transitions. [2018-11-10 01:49:59,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:49:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1129 transitions. [2018-11-10 01:49:59,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 01:49:59,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:59,700 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-10 01:49:59,700 INFO L424 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:59,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:59,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1391045094, now seen corresponding path program 1 times [2018-11-10 01:49:59,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:59,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:59,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:59,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:59,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:59,817 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-10 01:49:59,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:59,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:49:59,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:49:59,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:49:59,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:49:59,817 INFO L87 Difference]: Start difference. First operand 840 states and 1129 transitions. Second operand 10 states. [2018-11-10 01:49:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:59,985 INFO L93 Difference]: Finished difference Result 853 states and 1143 transitions. [2018-11-10 01:49:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 01:49:59,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-10 01:49:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:59,990 INFO L225 Difference]: With dead ends: 853 [2018-11-10 01:49:59,990 INFO L226 Difference]: Without dead ends: 835 [2018-11-10 01:49:59,991 INFO L605 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-10 01:49:59,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-10 01:50:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2018-11-10 01:50:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-11-10 01:50:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1122 transitions. [2018-11-10 01:50:00,045 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1122 transitions. Word has length 56 [2018-11-10 01:50:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:00,045 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 1122 transitions. [2018-11-10 01:50:00,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:50:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1122 transitions. [2018-11-10 01:50:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 01:50:00,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:00,048 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 01:50:00,048 INFO L424 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:00,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1363757591, now seen corresponding path program 1 times [2018-11-10 01:50:00,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:00,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:00,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:50:00,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:00,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:50:00,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:50:00,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:50:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:50:00,093 INFO L87 Difference]: Start difference. First operand 835 states and 1122 transitions. Second operand 3 states. [2018-11-10 01:50:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:00,137 INFO L93 Difference]: Finished difference Result 1091 states and 1459 transitions. [2018-11-10 01:50:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:50:00,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-10 01:50:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:00,139 INFO L225 Difference]: With dead ends: 1091 [2018-11-10 01:50:00,140 INFO L226 Difference]: Without dead ends: 926 [2018-11-10 01:50:00,140 INFO L605 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-10 01:50:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2018-11-10 01:50:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 895. [2018-11-10 01:50:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-10 01:50:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1199 transitions. [2018-11-10 01:50:00,173 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1199 transitions. Word has length 74 [2018-11-10 01:50:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:00,173 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1199 transitions. [2018-11-10 01:50:00,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:50:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1199 transitions. [2018-11-10 01:50:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 01:50:00,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:00,175 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-10 01:50:00,175 INFO L424 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:00,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1025869542, now seen corresponding path program 1 times [2018-11-10 01:50:00,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:00,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:00,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:00,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:00,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:00,274 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-10 01:50:00,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:00,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:00,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:00,275 INFO L87 Difference]: Start difference. First operand 895 states and 1199 transitions. Second operand 11 states. [2018-11-10 01:50:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:00,442 INFO L93 Difference]: Finished difference Result 912 states and 1217 transitions. [2018-11-10 01:50:00,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:00,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-10 01:50:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:00,445 INFO L225 Difference]: With dead ends: 912 [2018-11-10 01:50:00,445 INFO L226 Difference]: Without dead ends: 892 [2018-11-10 01:50:00,446 INFO L605 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-10 01:50:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-11-10 01:50:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2018-11-10 01:50:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-10 01:50:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1194 transitions. [2018-11-10 01:50:00,531 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1194 transitions. Word has length 58 [2018-11-10 01:50:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:00,531 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 1194 transitions. [2018-11-10 01:50:00,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1194 transitions. [2018-11-10 01:50:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 01:50:00,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:00,534 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-10 01:50:00,534 INFO L424 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:00,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:00,534 INFO L82 PathProgramCache]: Analyzing trace with hash 161227665, now seen corresponding path program 1 times [2018-11-10 01:50:00,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:00,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:00,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:00,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:00,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:00,649 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-10 01:50:00,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:00,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 01:50:00,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 01:50:00,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 01:50:00,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:50:00,650 INFO L87 Difference]: Start difference. First operand 892 states and 1194 transitions. Second operand 12 states. [2018-11-10 01:50:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:00,818 INFO L93 Difference]: Finished difference Result 918 states and 1222 transitions. [2018-11-10 01:50:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:50:00,819 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-10 01:50:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:00,821 INFO L225 Difference]: With dead ends: 918 [2018-11-10 01:50:00,821 INFO L226 Difference]: Without dead ends: 893 [2018-11-10 01:50:00,822 INFO L605 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-10 01:50:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-11-10 01:50:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 891. [2018-11-10 01:50:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-11-10 01:50:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1183 transitions. [2018-11-10 01:50:00,882 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1183 transitions. Word has length 59 [2018-11-10 01:50:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:00,882 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1183 transitions. [2018-11-10 01:50:00,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 01:50:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1183 transitions. [2018-11-10 01:50:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 01:50:00,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:00,885 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-10 01:50:00,886 INFO L424 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:00,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:00,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1584207719, now seen corresponding path program 1 times [2018-11-10 01:50:00,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:00,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:00,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:00,932 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-10 01:50:00,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:00,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:50:00,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:50:00,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:50:00,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:50:00,933 INFO L87 Difference]: Start difference. First operand 891 states and 1183 transitions. Second operand 3 states. [2018-11-10 01:50:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:00,990 INFO L93 Difference]: Finished difference Result 925 states and 1217 transitions. [2018-11-10 01:50:00,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:50:00,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-10 01:50:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:00,993 INFO L225 Difference]: With dead ends: 925 [2018-11-10 01:50:00,993 INFO L226 Difference]: Without dead ends: 893 [2018-11-10 01:50:00,994 INFO L605 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-10 01:50:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-11-10 01:50:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 891. [2018-11-10 01:50:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-11-10 01:50:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1182 transitions. [2018-11-10 01:50:01,048 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1182 transitions. Word has length 59 [2018-11-10 01:50:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:01,048 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1182 transitions. [2018-11-10 01:50:01,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:50:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1182 transitions. [2018-11-10 01:50:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 01:50:01,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:01,050 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-10 01:50:01,050 INFO L424 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:01,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1074734629, now seen corresponding path program 1 times [2018-11-10 01:50:01,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:01,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:01,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:01,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:01,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:01,135 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-10 01:50:01,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:01,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:50:01,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:50:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:50:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:50:01,136 INFO L87 Difference]: Start difference. First operand 891 states and 1182 transitions. Second operand 9 states. [2018-11-10 01:50:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:01,248 INFO L93 Difference]: Finished difference Result 913 states and 1205 transitions. [2018-11-10 01:50:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:50:01,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-10 01:50:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:01,251 INFO L225 Difference]: With dead ends: 913 [2018-11-10 01:50:01,251 INFO L226 Difference]: Without dead ends: 879 [2018-11-10 01:50:01,252 INFO L605 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-10 01:50:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-10 01:50:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2018-11-10 01:50:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-10 01:50:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1162 transitions. [2018-11-10 01:50:01,284 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1162 transitions. Word has length 59 [2018-11-10 01:50:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:01,285 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1162 transitions. [2018-11-10 01:50:01,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:50:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1162 transitions. [2018-11-10 01:50:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 01:50:01,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:01,287 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-10 01:50:01,287 INFO L424 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:01,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash 518615990, now seen corresponding path program 1 times [2018-11-10 01:50:01,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:01,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:01,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:01,333 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-10 01:50:01,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:01,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:50:01,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:50:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:50:01,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:50:01,334 INFO L87 Difference]: Start difference. First operand 879 states and 1162 transitions. Second operand 4 states. [2018-11-10 01:50:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:01,448 INFO L93 Difference]: Finished difference Result 1039 states and 1390 transitions. [2018-11-10 01:50:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:50:01,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-10 01:50:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:01,452 INFO L225 Difference]: With dead ends: 1039 [2018-11-10 01:50:01,452 INFO L226 Difference]: Without dead ends: 928 [2018-11-10 01:50:01,453 INFO L605 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-10 01:50:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-11-10 01:50:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 886. [2018-11-10 01:50:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-11-10 01:50:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1178 transitions. [2018-11-10 01:50:01,507 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1178 transitions. Word has length 60 [2018-11-10 01:50:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:01,507 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1178 transitions. [2018-11-10 01:50:01,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:50:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1178 transitions. [2018-11-10 01:50:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 01:50:01,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:01,510 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-10 01:50:01,510 INFO L424 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:01,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 793375604, now seen corresponding path program 1 times [2018-11-10 01:50:01,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:01,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:01,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:01,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:01,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:01,606 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-10 01:50:01,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:01,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:01,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:01,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:01,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:01,606 INFO L87 Difference]: Start difference. First operand 886 states and 1178 transitions. Second operand 11 states. [2018-11-10 01:50:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:01,742 INFO L93 Difference]: Finished difference Result 955 states and 1271 transitions. [2018-11-10 01:50:01,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:01,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-10 01:50:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:01,746 INFO L225 Difference]: With dead ends: 955 [2018-11-10 01:50:01,746 INFO L226 Difference]: Without dead ends: 900 [2018-11-10 01:50:01,747 INFO L605 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-10 01:50:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-11-10 01:50:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 890. [2018-11-10 01:50:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-11-10 01:50:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1196 transitions. [2018-11-10 01:50:01,800 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1196 transitions. Word has length 60 [2018-11-10 01:50:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:01,801 INFO L481 AbstractCegarLoop]: Abstraction has 890 states and 1196 transitions. [2018-11-10 01:50:01,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1196 transitions. [2018-11-10 01:50:01,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 01:50:01,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:01,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] [2018-11-10 01:50:01,803 INFO L424 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:01,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:01,803 INFO L82 PathProgramCache]: Analyzing trace with hash 826541143, now seen corresponding path program 1 times [2018-11-10 01:50:01,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:01,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:01,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:01,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:01,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:01,884 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-10 01:50:01,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:01,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:50:01,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:50:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:50:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:50:01,885 INFO L87 Difference]: Start difference. First operand 890 states and 1196 transitions. Second operand 9 states. [2018-11-10 01:50:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:02,065 INFO L93 Difference]: Finished difference Result 921 states and 1233 transitions. [2018-11-10 01:50:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:50:02,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-10 01:50:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:02,068 INFO L225 Difference]: With dead ends: 921 [2018-11-10 01:50:02,068 INFO L226 Difference]: Without dead ends: 882 [2018-11-10 01:50:02,069 INFO L605 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-10 01:50:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2018-11-10 01:50:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2018-11-10 01:50:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-10 01:50:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1180 transitions. [2018-11-10 01:50:02,100 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1180 transitions. Word has length 60 [2018-11-10 01:50:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:02,100 INFO L481 AbstractCegarLoop]: Abstraction has 882 states and 1180 transitions. [2018-11-10 01:50:02,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:50:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1180 transitions. [2018-11-10 01:50:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 01:50:02,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:02,102 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-10 01:50:02,103 INFO L424 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:02,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1381266646, now seen corresponding path program 1 times [2018-11-10 01:50:02,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:02,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:02,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:02,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:02,223 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-10 01:50:02,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:02,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 01:50:02,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:50:02,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:50:02,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:50:02,224 INFO L87 Difference]: Start difference. First operand 882 states and 1180 transitions. Second operand 13 states. [2018-11-10 01:50:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:02,424 INFO L93 Difference]: Finished difference Result 899 states and 1198 transitions. [2018-11-10 01:50:02,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 01:50:02,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-10 01:50:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:02,427 INFO L225 Difference]: With dead ends: 899 [2018-11-10 01:50:02,427 INFO L226 Difference]: Without dead ends: 877 [2018-11-10 01:50:02,428 INFO L605 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-10 01:50:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-10 01:50:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2018-11-10 01:50:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-11-10 01:50:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1173 transitions. [2018-11-10 01:50:02,468 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1173 transitions. Word has length 62 [2018-11-10 01:50:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:02,468 INFO L481 AbstractCegarLoop]: Abstraction has 877 states and 1173 transitions. [2018-11-10 01:50:02,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:50:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1173 transitions. [2018-11-10 01:50:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 01:50:02,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:02,471 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-10 01:50:02,471 INFO L424 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:02,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2111475177, now seen corresponding path program 1 times [2018-11-10 01:50:02,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:02,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:02,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:02,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:02,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:02,495 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-10 01:50:02,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:02,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:50:02,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:50:02,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:50:02,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:50:02,496 INFO L87 Difference]: Start difference. First operand 877 states and 1173 transitions. Second operand 3 states. [2018-11-10 01:50:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:02,547 INFO L93 Difference]: Finished difference Result 1168 states and 1561 transitions. [2018-11-10 01:50:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:50:02,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-10 01:50:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:02,550 INFO L225 Difference]: With dead ends: 1168 [2018-11-10 01:50:02,550 INFO L226 Difference]: Without dead ends: 802 [2018-11-10 01:50:02,551 INFO L605 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-10 01:50:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-11-10 01:50:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 769. [2018-11-10 01:50:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-11-10 01:50:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 998 transitions. [2018-11-10 01:50:02,578 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 998 transitions. Word has length 62 [2018-11-10 01:50:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:02,578 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 998 transitions. [2018-11-10 01:50:02,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:50:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 998 transitions. [2018-11-10 01:50:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 01:50:02,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:02,580 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-10 01:50:02,580 INFO L424 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:02,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:02,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1768811547, now seen corresponding path program 1 times [2018-11-10 01:50:02,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:02,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:02,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:02,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:02,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:02,656 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-10 01:50:02,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:02,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 01:50:02,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 01:50:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 01:50:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:50:02,657 INFO L87 Difference]: Start difference. First operand 769 states and 998 transitions. Second operand 12 states. [2018-11-10 01:50:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:02,798 INFO L93 Difference]: Finished difference Result 791 states and 1021 transitions. [2018-11-10 01:50:02,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:50:02,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-10 01:50:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:02,800 INFO L225 Difference]: With dead ends: 791 [2018-11-10 01:50:02,801 INFO L226 Difference]: Without dead ends: 767 [2018-11-10 01:50:02,801 INFO L605 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-10 01:50:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-11-10 01:50:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2018-11-10 01:50:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-11-10 01:50:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 994 transitions. [2018-11-10 01:50:02,829 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 994 transitions. Word has length 63 [2018-11-10 01:50:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:02,830 INFO L481 AbstractCegarLoop]: Abstraction has 767 states and 994 transitions. [2018-11-10 01:50:02,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 01:50:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 994 transitions. [2018-11-10 01:50:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 01:50:02,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:02,831 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-10 01:50:02,832 INFO L424 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:02,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1306248093, now seen corresponding path program 1 times [2018-11-10 01:50:02,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:02,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:02,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:02,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:02,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-10 01:50:02,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:02,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 01:50:02,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 01:50:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 01:50:02,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:50:02,911 INFO L87 Difference]: Start difference. First operand 767 states and 994 transitions. Second operand 12 states. [2018-11-10 01:50:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:03,048 INFO L93 Difference]: Finished difference Result 791 states and 1019 transitions. [2018-11-10 01:50:03,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:50:03,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-10 01:50:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:03,051 INFO L225 Difference]: With dead ends: 791 [2018-11-10 01:50:03,051 INFO L226 Difference]: Without dead ends: 767 [2018-11-10 01:50:03,051 INFO L605 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-10 01:50:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-11-10 01:50:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2018-11-10 01:50:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-11-10 01:50:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 990 transitions. [2018-11-10 01:50:03,079 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 990 transitions. Word has length 66 [2018-11-10 01:50:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:03,079 INFO L481 AbstractCegarLoop]: Abstraction has 765 states and 990 transitions. [2018-11-10 01:50:03,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 01:50:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 990 transitions. [2018-11-10 01:50:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 01:50:03,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:03,081 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-10 01:50:03,081 INFO L424 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:03,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:03,081 INFO L82 PathProgramCache]: Analyzing trace with hash -90982747, now seen corresponding path program 1 times [2018-11-10 01:50:03,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:03,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:03,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:03,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:50:03,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:03,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:03,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:03,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:03,124 INFO L87 Difference]: Start difference. First operand 765 states and 990 transitions. Second operand 5 states. [2018-11-10 01:50:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:03,205 INFO L93 Difference]: Finished difference Result 799 states and 1029 transitions. [2018-11-10 01:50:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:03,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-10 01:50:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:03,208 INFO L225 Difference]: With dead ends: 799 [2018-11-10 01:50:03,208 INFO L226 Difference]: Without dead ends: 772 [2018-11-10 01:50:03,208 INFO L605 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-10 01:50:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-11-10 01:50:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2018-11-10 01:50:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-11-10 01:50:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 998 transitions. [2018-11-10 01:50:03,240 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 998 transitions. Word has length 67 [2018-11-10 01:50:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:03,240 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 998 transitions. [2018-11-10 01:50:03,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 998 transitions. [2018-11-10 01:50:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 01:50:03,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:03,241 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-10 01:50:03,242 INFO L424 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:03,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1315765278, now seen corresponding path program 1 times [2018-11-10 01:50:03,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:03,320 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-10 01:50:03,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:03,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 01:50:03,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 01:50:03,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 01:50:03,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:50:03,321 INFO L87 Difference]: Start difference. First operand 770 states and 998 transitions. Second operand 12 states. [2018-11-10 01:50:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:03,447 INFO L93 Difference]: Finished difference Result 794 states and 1023 transitions. [2018-11-10 01:50:03,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:50:03,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-10 01:50:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:03,450 INFO L225 Difference]: With dead ends: 794 [2018-11-10 01:50:03,450 INFO L226 Difference]: Without dead ends: 770 [2018-11-10 01:50:03,451 INFO L605 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-10 01:50:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-11-10 01:50:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 768. [2018-11-10 01:50:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-11-10 01:50:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 994 transitions. [2018-11-10 01:50:03,478 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 994 transitions. Word has length 62 [2018-11-10 01:50:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:03,478 INFO L481 AbstractCegarLoop]: Abstraction has 768 states and 994 transitions. [2018-11-10 01:50:03,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 01:50:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 994 transitions. [2018-11-10 01:50:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 01:50:03,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:03,480 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-10 01:50:03,480 INFO L424 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:03,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:03,480 INFO L82 PathProgramCache]: Analyzing trace with hash 940267595, now seen corresponding path program 1 times [2018-11-10 01:50:03,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:03,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:03,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:03,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:03,579 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-10 01:50:03,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:03,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 01:50:03,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:50:03,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:50:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:50:03,580 INFO L87 Difference]: Start difference. First operand 768 states and 994 transitions. Second operand 13 states. [2018-11-10 01:50:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:03,743 INFO L93 Difference]: Finished difference Result 785 states and 1012 transitions. [2018-11-10 01:50:03,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 01:50:03,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-10 01:50:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:03,745 INFO L225 Difference]: With dead ends: 785 [2018-11-10 01:50:03,745 INFO L226 Difference]: Without dead ends: 763 [2018-11-10 01:50:03,746 INFO L605 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-10 01:50:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-11-10 01:50:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2018-11-10 01:50:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 01:50:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 987 transitions. [2018-11-10 01:50:03,773 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 987 transitions. Word has length 63 [2018-11-10 01:50:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:03,774 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 987 transitions. [2018-11-10 01:50:03,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:50:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 987 transitions. [2018-11-10 01:50:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 01:50:03,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:03,775 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-10 01:50:03,775 INFO L424 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:03,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1524846702, now seen corresponding path program 1 times [2018-11-10 01:50:03,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:03,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:03,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:03,802 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-10 01:50:03,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:03,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:50:03,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:50:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:50:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:50:03,803 INFO L87 Difference]: Start difference. First operand 763 states and 987 transitions. Second operand 3 states. [2018-11-10 01:50:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:03,833 INFO L93 Difference]: Finished difference Result 895 states and 1162 transitions. [2018-11-10 01:50:03,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:50:03,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-10 01:50:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:03,835 INFO L225 Difference]: With dead ends: 895 [2018-11-10 01:50:03,835 INFO L226 Difference]: Without dead ends: 763 [2018-11-10 01:50:03,836 INFO L605 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-10 01:50:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-11-10 01:50:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2018-11-10 01:50:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 01:50:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 985 transitions. [2018-11-10 01:50:03,863 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 985 transitions. Word has length 66 [2018-11-10 01:50:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:03,864 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 985 transitions. [2018-11-10 01:50:03,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:50:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 985 transitions. [2018-11-10 01:50:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 01:50:03,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:03,865 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-10 01:50:03,865 INFO L424 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:03,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2028069485, now seen corresponding path program 1 times [2018-11-10 01:50:03,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:03,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:03,903 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-10 01:50:03,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:03,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:03,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:03,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:03,904 INFO L87 Difference]: Start difference. First operand 763 states and 985 transitions. Second operand 5 states. [2018-11-10 01:50:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:03,963 INFO L93 Difference]: Finished difference Result 817 states and 1044 transitions. [2018-11-10 01:50:03,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:03,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-10 01:50:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:03,966 INFO L225 Difference]: With dead ends: 817 [2018-11-10 01:50:03,966 INFO L226 Difference]: Without dead ends: 765 [2018-11-10 01:50:03,967 INFO L605 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-10 01:50:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-10 01:50:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 763. [2018-11-10 01:50:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 01:50:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 984 transitions. [2018-11-10 01:50:03,995 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 984 transitions. Word has length 65 [2018-11-10 01:50:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:03,995 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 984 transitions. [2018-11-10 01:50:03,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 984 transitions. [2018-11-10 01:50:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 01:50:03,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:03,997 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-10 01:50:03,997 INFO L424 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:03,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:03,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1565297937, now seen corresponding path program 1 times [2018-11-10 01:50:03,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:03,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:03,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:03,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:03,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:04,040 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-10 01:50:04,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:04,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:04,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:04,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:04,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:04,041 INFO L87 Difference]: Start difference. First operand 763 states and 984 transitions. Second operand 5 states. [2018-11-10 01:50:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:04,208 INFO L93 Difference]: Finished difference Result 827 states and 1059 transitions. [2018-11-10 01:50:04,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:04,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-10 01:50:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:04,210 INFO L225 Difference]: With dead ends: 827 [2018-11-10 01:50:04,211 INFO L226 Difference]: Without dead ends: 794 [2018-11-10 01:50:04,211 INFO L605 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-10 01:50:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-10 01:50:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 769. [2018-11-10 01:50:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-11-10 01:50:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 991 transitions. [2018-11-10 01:50:04,254 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 991 transitions. Word has length 65 [2018-11-10 01:50:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:04,254 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 991 transitions. [2018-11-10 01:50:04,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 991 transitions. [2018-11-10 01:50:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 01:50:04,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:04,256 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-10 01:50:04,256 INFO L424 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:04,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1088995916, now seen corresponding path program 1 times [2018-11-10 01:50:04,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:04,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:04,329 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-10 01:50:04,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:04,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:04,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:04,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:04,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:04,330 INFO L87 Difference]: Start difference. First operand 769 states and 991 transitions. Second operand 6 states. [2018-11-10 01:50:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:04,458 INFO L93 Difference]: Finished difference Result 803 states and 1025 transitions. [2018-11-10 01:50:04,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:04,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-10 01:50:04,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:04,460 INFO L225 Difference]: With dead ends: 803 [2018-11-10 01:50:04,460 INFO L226 Difference]: Without dead ends: 771 [2018-11-10 01:50:04,460 INFO L605 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-10 01:50:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-11-10 01:50:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2018-11-10 01:50:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-11-10 01:50:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 990 transitions. [2018-11-10 01:50:04,489 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 990 transitions. Word has length 66 [2018-11-10 01:50:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:04,489 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 990 transitions. [2018-11-10 01:50:04,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 990 transitions. [2018-11-10 01:50:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 01:50:04,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:04,491 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-10 01:50:04,491 INFO L424 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:04,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash 579522826, now seen corresponding path program 1 times [2018-11-10 01:50:04,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:04,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:04,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:04,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:04,553 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-10 01:50:04,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:04,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:04,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:04,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:04,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:04,554 INFO L87 Difference]: Start difference. First operand 769 states and 990 transitions. Second operand 11 states. [2018-11-10 01:50:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:04,651 INFO L93 Difference]: Finished difference Result 791 states and 1013 transitions. [2018-11-10 01:50:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:04,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-11-10 01:50:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:04,653 INFO L225 Difference]: With dead ends: 791 [2018-11-10 01:50:04,654 INFO L226 Difference]: Without dead ends: 765 [2018-11-10 01:50:04,654 INFO L605 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-10 01:50:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-10 01:50:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 759. [2018-11-10 01:50:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-10 01:50:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 977 transitions. [2018-11-10 01:50:04,683 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 977 transitions. Word has length 66 [2018-11-10 01:50:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:04,683 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 977 transitions. [2018-11-10 01:50:04,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 977 transitions. [2018-11-10 01:50:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 01:50:04,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:04,684 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-10 01:50:04,685 INFO L424 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:04,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:04,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1636942650, now seen corresponding path program 1 times [2018-11-10 01:50:04,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:04,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:04,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:04,770 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-10 01:50:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:04,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 01:50:04,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 01:50:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 01:50:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:50:04,771 INFO L87 Difference]: Start difference. First operand 759 states and 977 transitions. Second operand 12 states. [2018-11-10 01:50:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:04,873 INFO L93 Difference]: Finished difference Result 782 states and 1001 transitions. [2018-11-10 01:50:04,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:50:04,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-10 01:50:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:04,875 INFO L225 Difference]: With dead ends: 782 [2018-11-10 01:50:04,875 INFO L226 Difference]: Without dead ends: 759 [2018-11-10 01:50:04,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:50:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-10 01:50:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2018-11-10 01:50:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-10 01:50:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 976 transitions. [2018-11-10 01:50:04,923 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 976 transitions. Word has length 70 [2018-11-10 01:50:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:04,924 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 976 transitions. [2018-11-10 01:50:04,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 01:50:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 976 transitions. [2018-11-10 01:50:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 01:50:04,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:04,925 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-10 01:50:04,925 INFO L424 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:04,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 610617127, now seen corresponding path program 1 times [2018-11-10 01:50:04,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:04,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:05,023 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-10 01:50:05,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:05,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 01:50:05,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 01:50:05,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 01:50:05,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:50:05,024 INFO L87 Difference]: Start difference. First operand 759 states and 976 transitions. Second operand 12 states. [2018-11-10 01:50:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:05,250 INFO L93 Difference]: Finished difference Result 781 states and 999 transitions. [2018-11-10 01:50:05,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:50:05,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-10 01:50:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:05,252 INFO L225 Difference]: With dead ends: 781 [2018-11-10 01:50:05,253 INFO L226 Difference]: Without dead ends: 757 [2018-11-10 01:50:05,253 INFO L605 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-10 01:50:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-11-10 01:50:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2018-11-10 01:50:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-11-10 01:50:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 972 transitions. [2018-11-10 01:50:05,284 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 972 transitions. Word has length 67 [2018-11-10 01:50:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:05,284 INFO L481 AbstractCegarLoop]: Abstraction has 757 states and 972 transitions. [2018-11-10 01:50:05,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 01:50:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 972 transitions. [2018-11-10 01:50:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 01:50:05,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:05,285 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-10 01:50:05,286 INFO L424 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:05,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash -59264446, now seen corresponding path program 1 times [2018-11-10 01:50:05,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:05,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:05,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:05,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:05,318 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-10 01:50:05,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:05,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:05,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:05,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:05,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:05,319 INFO L87 Difference]: Start difference. First operand 757 states and 972 transitions. Second operand 5 states. [2018-11-10 01:50:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:05,368 INFO L93 Difference]: Finished difference Result 798 states and 1016 transitions. [2018-11-10 01:50:05,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:05,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-10 01:50:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:05,371 INFO L225 Difference]: With dead ends: 798 [2018-11-10 01:50:05,371 INFO L226 Difference]: Without dead ends: 764 [2018-11-10 01:50:05,372 INFO L605 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-10 01:50:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-11-10 01:50:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 757. [2018-11-10 01:50:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-11-10 01:50:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 971 transitions. [2018-11-10 01:50:05,401 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 971 transitions. Word has length 67 [2018-11-10 01:50:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:05,402 INFO L481 AbstractCegarLoop]: Abstraction has 757 states and 971 transitions. [2018-11-10 01:50:05,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 971 transitions. [2018-11-10 01:50:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 01:50:05,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:05,403 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-10 01:50:05,403 INFO L424 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:05,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1508193805, now seen corresponding path program 1 times [2018-11-10 01:50:05,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:05,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:05,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-10 01:50:05,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:05,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:05,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:05,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:05,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:05,455 INFO L87 Difference]: Start difference. First operand 757 states and 971 transitions. Second operand 6 states. [2018-11-10 01:50:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:05,527 INFO L93 Difference]: Finished difference Result 796 states and 1012 transitions. [2018-11-10 01:50:05,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:05,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-10 01:50:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:05,529 INFO L225 Difference]: With dead ends: 796 [2018-11-10 01:50:05,529 INFO L226 Difference]: Without dead ends: 764 [2018-11-10 01:50:05,530 INFO L605 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-10 01:50:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-11-10 01:50:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 759. [2018-11-10 01:50:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-10 01:50:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 973 transitions. [2018-11-10 01:50:05,578 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 973 transitions. Word has length 68 [2018-11-10 01:50:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:05,578 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 973 transitions. [2018-11-10 01:50:05,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 973 transitions. [2018-11-10 01:50:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 01:50:05,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:05,580 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-10 01:50:05,580 INFO L424 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:05,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2017666895, now seen corresponding path program 1 times [2018-11-10 01:50:05,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:05,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:05,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:05,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:05,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:05,702 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-10 01:50:05,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:05,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:05,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:05,703 INFO L87 Difference]: Start difference. First operand 759 states and 973 transitions. Second operand 11 states. [2018-11-10 01:50:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:05,913 INFO L93 Difference]: Finished difference Result 784 states and 1000 transitions. [2018-11-10 01:50:05,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:05,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-10 01:50:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:05,915 INFO L225 Difference]: With dead ends: 784 [2018-11-10 01:50:05,915 INFO L226 Difference]: Without dead ends: 751 [2018-11-10 01:50:05,915 INFO L605 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-10 01:50:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-11-10 01:50:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2018-11-10 01:50:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-11-10 01:50:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 963 transitions. [2018-11-10 01:50:05,961 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 963 transitions. Word has length 68 [2018-11-10 01:50:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:05,961 INFO L481 AbstractCegarLoop]: Abstraction has 751 states and 963 transitions. [2018-11-10 01:50:05,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 963 transitions. [2018-11-10 01:50:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 01:50:05,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:05,962 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-10 01:50:05,963 INFO L424 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:05,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:05,963 INFO L82 PathProgramCache]: Analyzing trace with hash 491674496, now seen corresponding path program 1 times [2018-11-10 01:50:05,963 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:05,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:05,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:05,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:06,019 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-10 01:50:06,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:06,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:06,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:06,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:06,020 INFO L87 Difference]: Start difference. First operand 751 states and 963 transitions. Second operand 6 states. [2018-11-10 01:50:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:06,102 INFO L93 Difference]: Finished difference Result 798 states and 1011 transitions. [2018-11-10 01:50:06,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:06,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-10 01:50:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:06,106 INFO L225 Difference]: With dead ends: 798 [2018-11-10 01:50:06,106 INFO L226 Difference]: Without dead ends: 746 [2018-11-10 01:50:06,106 INFO L605 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-10 01:50:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-10 01:50:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-11-10 01:50:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-10 01:50:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 950 transitions. [2018-11-10 01:50:06,150 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 950 transitions. Word has length 68 [2018-11-10 01:50:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:06,150 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 950 transitions. [2018-11-10 01:50:06,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 950 transitions. [2018-11-10 01:50:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 01:50:06,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:06,152 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-10 01:50:06,152 INFO L424 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:06,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash -17798594, now seen corresponding path program 1 times [2018-11-10 01:50:06,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:06,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:06,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:06,228 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-10 01:50:06,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:06,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:06,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:06,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:06,229 INFO L87 Difference]: Start difference. First operand 744 states and 950 transitions. Second operand 11 states. [2018-11-10 01:50:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:06,356 INFO L93 Difference]: Finished difference Result 766 states and 973 transitions. [2018-11-10 01:50:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:06,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-10 01:50:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:06,358 INFO L225 Difference]: With dead ends: 766 [2018-11-10 01:50:06,358 INFO L226 Difference]: Without dead ends: 734 [2018-11-10 01:50:06,359 INFO L605 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-10 01:50:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-10 01:50:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-10 01:50:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 01:50:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 936 transitions. [2018-11-10 01:50:06,385 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 936 transitions. Word has length 68 [2018-11-10 01:50:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:06,386 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 936 transitions. [2018-11-10 01:50:06,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 936 transitions. [2018-11-10 01:50:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 01:50:06,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:06,387 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-10 01:50:06,387 INFO L424 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:06,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1487313881, now seen corresponding path program 1 times [2018-11-10 01:50:06,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:06,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:06,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:06,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:06,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:50:06,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:06,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:06,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:06,420 INFO L87 Difference]: Start difference. First operand 734 states and 936 transitions. Second operand 5 states. [2018-11-10 01:50:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:06,718 INFO L93 Difference]: Finished difference Result 813 states and 1038 transitions. [2018-11-10 01:50:06,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:06,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-10 01:50:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:06,721 INFO L225 Difference]: With dead ends: 813 [2018-11-10 01:50:06,721 INFO L226 Difference]: Without dead ends: 807 [2018-11-10 01:50:06,722 INFO L605 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-10 01:50:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-11-10 01:50:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 734. [2018-11-10 01:50:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 01:50:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 935 transitions. [2018-11-10 01:50:06,749 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 935 transitions. Word has length 68 [2018-11-10 01:50:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:06,750 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 935 transitions. [2018-11-10 01:50:06,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 935 transitions. [2018-11-10 01:50:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 01:50:06,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:06,750 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-10 01:50:06,751 INFO L424 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:06,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -217966723, now seen corresponding path program 1 times [2018-11-10 01:50:06,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:06,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:06,789 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-10 01:50:06,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:06,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:06,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:06,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:06,790 INFO L87 Difference]: Start difference. First operand 734 states and 935 transitions. Second operand 5 states. [2018-11-10 01:50:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:06,878 INFO L93 Difference]: Finished difference Result 775 states and 979 transitions. [2018-11-10 01:50:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:06,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-10 01:50:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:06,882 INFO L225 Difference]: With dead ends: 775 [2018-11-10 01:50:06,882 INFO L226 Difference]: Without dead ends: 741 [2018-11-10 01:50:06,882 INFO L605 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-10 01:50:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-10 01:50:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 734. [2018-11-10 01:50:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 01:50:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 934 transitions. [2018-11-10 01:50:06,930 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 934 transitions. Word has length 69 [2018-11-10 01:50:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:06,930 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 934 transitions. [2018-11-10 01:50:06,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 934 transitions. [2018-11-10 01:50:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 01:50:06,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:06,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, 1, 1] [2018-11-10 01:50:06,931 INFO L424 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:06,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:06,932 INFO L82 PathProgramCache]: Analyzing trace with hash -195334469, now seen corresponding path program 1 times [2018-11-10 01:50:06,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:06,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:06,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:06,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:06,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:06,990 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-10 01:50:06,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:06,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:06,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:06,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:06,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:06,991 INFO L87 Difference]: Start difference. First operand 734 states and 934 transitions. Second operand 6 states. [2018-11-10 01:50:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:07,051 INFO L93 Difference]: Finished difference Result 773 states and 975 transitions. [2018-11-10 01:50:07,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:07,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-10 01:50:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:07,052 INFO L225 Difference]: With dead ends: 773 [2018-11-10 01:50:07,052 INFO L226 Difference]: Without dead ends: 741 [2018-11-10 01:50:07,052 INFO L605 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-10 01:50:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-10 01:50:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 736. [2018-11-10 01:50:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-10 01:50:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 936 transitions. [2018-11-10 01:50:07,081 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 936 transitions. Word has length 69 [2018-11-10 01:50:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:07,081 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 936 transitions. [2018-11-10 01:50:07,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 936 transitions. [2018-11-10 01:50:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 01:50:07,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:07,082 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-10 01:50:07,082 INFO L424 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:07,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash -704807559, now seen corresponding path program 1 times [2018-11-10 01:50:07,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:07,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:07,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:07,170 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-10 01:50:07,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:07,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:07,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:07,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:07,171 INFO L87 Difference]: Start difference. First operand 736 states and 936 transitions. Second operand 11 states. [2018-11-10 01:50:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:07,273 INFO L93 Difference]: Finished difference Result 761 states and 963 transitions. [2018-11-10 01:50:07,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:07,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-10 01:50:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:07,274 INFO L225 Difference]: With dead ends: 761 [2018-11-10 01:50:07,274 INFO L226 Difference]: Without dead ends: 729 [2018-11-10 01:50:07,274 INFO L605 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-10 01:50:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-11-10 01:50:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2018-11-10 01:50:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-11-10 01:50:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 927 transitions. [2018-11-10 01:50:07,310 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 927 transitions. Word has length 69 [2018-11-10 01:50:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:07,310 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 927 transitions. [2018-11-10 01:50:07,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 927 transitions. [2018-11-10 01:50:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 01:50:07,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:07,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] [2018-11-10 01:50:07,311 INFO L424 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:07,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash -338104504, now seen corresponding path program 1 times [2018-11-10 01:50:07,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:07,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:07,356 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-10 01:50:07,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:07,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:07,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:07,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:07,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:07,357 INFO L87 Difference]: Start difference. First operand 729 states and 927 transitions. Second operand 6 states. [2018-11-10 01:50:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:07,406 INFO L93 Difference]: Finished difference Result 768 states and 968 transitions. [2018-11-10 01:50:07,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:07,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-10 01:50:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:07,407 INFO L225 Difference]: With dead ends: 768 [2018-11-10 01:50:07,408 INFO L226 Difference]: Without dead ends: 736 [2018-11-10 01:50:07,408 INFO L605 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-10 01:50:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-11-10 01:50:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 731. [2018-11-10 01:50:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-11-10 01:50:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 929 transitions. [2018-11-10 01:50:07,436 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 929 transitions. Word has length 69 [2018-11-10 01:50:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:07,436 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 929 transitions. [2018-11-10 01:50:07,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 929 transitions. [2018-11-10 01:50:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 01:50:07,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:07,437 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-10 01:50:07,437 INFO L424 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:07,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash -847577594, now seen corresponding path program 1 times [2018-11-10 01:50:07,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:07,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:07,519 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-10 01:50:07,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:07,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:07,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:07,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:07,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:07,519 INFO L87 Difference]: Start difference. First operand 731 states and 929 transitions. Second operand 11 states. [2018-11-10 01:50:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:07,596 INFO L93 Difference]: Finished difference Result 756 states and 956 transitions. [2018-11-10 01:50:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:07,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-10 01:50:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:07,601 INFO L225 Difference]: With dead ends: 756 [2018-11-10 01:50:07,602 INFO L226 Difference]: Without dead ends: 726 [2018-11-10 01:50:07,602 INFO L605 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-10 01:50:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-11-10 01:50:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2018-11-10 01:50:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-10 01:50:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 922 transitions. [2018-11-10 01:50:07,629 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 922 transitions. Word has length 69 [2018-11-10 01:50:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:07,629 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 922 transitions. [2018-11-10 01:50:07,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 922 transitions. [2018-11-10 01:50:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 01:50:07,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:07,630 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-10 01:50:07,630 INFO L424 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:07,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1778230437, now seen corresponding path program 1 times [2018-11-10 01:50:07,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:07,701 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-10 01:50:07,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:07,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:07,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:07,702 INFO L87 Difference]: Start difference. First operand 726 states and 922 transitions. Second operand 11 states. [2018-11-10 01:50:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:07,822 INFO L93 Difference]: Finished difference Result 736 states and 931 transitions. [2018-11-10 01:50:07,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:07,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-10 01:50:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:07,823 INFO L225 Difference]: With dead ends: 736 [2018-11-10 01:50:07,823 INFO L226 Difference]: Without dead ends: 730 [2018-11-10 01:50:07,824 INFO L605 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-10 01:50:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-11-10 01:50:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2018-11-10 01:50:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-10 01:50:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 918 transitions. [2018-11-10 01:50:07,850 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 918 transitions. Word has length 69 [2018-11-10 01:50:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:07,851 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 918 transitions. [2018-11-10 01:50:07,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 918 transitions. [2018-11-10 01:50:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 01:50:07,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:07,851 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-10 01:50:07,852 INFO L424 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:07,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1778507267, now seen corresponding path program 1 times [2018-11-10 01:50:07,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:07,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:07,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:07,877 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-10 01:50:07,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:07,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:07,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:07,877 INFO L87 Difference]: Start difference. First operand 724 states and 918 transitions. Second operand 5 states. [2018-11-10 01:50:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:08,076 INFO L93 Difference]: Finished difference Result 799 states and 1016 transitions. [2018-11-10 01:50:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:08,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-10 01:50:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:08,077 INFO L225 Difference]: With dead ends: 799 [2018-11-10 01:50:08,078 INFO L226 Difference]: Without dead ends: 737 [2018-11-10 01:50:08,078 INFO L605 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-10 01:50:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-10 01:50:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 668. [2018-11-10 01:50:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-11-10 01:50:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 847 transitions. [2018-11-10 01:50:08,104 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 847 transitions. Word has length 69 [2018-11-10 01:50:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:08,105 INFO L481 AbstractCegarLoop]: Abstraction has 668 states and 847 transitions. [2018-11-10 01:50:08,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 847 transitions. [2018-11-10 01:50:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 01:50:08,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:08,106 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-10 01:50:08,106 INFO L424 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:08,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1485554770, now seen corresponding path program 1 times [2018-11-10 01:50:08,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:08,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:08,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:08,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:08,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:08,167 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-10 01:50:08,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:08,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 01:50:08,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 01:50:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 01:50:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:50:08,168 INFO L87 Difference]: Start difference. First operand 668 states and 847 transitions. Second operand 7 states. [2018-11-10 01:50:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:08,233 INFO L93 Difference]: Finished difference Result 714 states and 894 transitions. [2018-11-10 01:50:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:50:08,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-10 01:50:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:08,235 INFO L225 Difference]: With dead ends: 714 [2018-11-10 01:50:08,235 INFO L226 Difference]: Without dead ends: 669 [2018-11-10 01:50:08,236 INFO L605 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-10 01:50:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-11-10 01:50:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2018-11-10 01:50:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-11-10 01:50:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 843 transitions. [2018-11-10 01:50:08,261 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 843 transitions. Word has length 74 [2018-11-10 01:50:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:08,261 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 843 transitions. [2018-11-10 01:50:08,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 01:50:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 843 transitions. [2018-11-10 01:50:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 01:50:08,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:08,262 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-10 01:50:08,262 INFO L424 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:08,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2107812652, now seen corresponding path program 1 times [2018-11-10 01:50:08,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:08,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:08,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:08,334 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-10 01:50:08,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:08,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 01:50:08,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:50:08,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:50:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:50:08,335 INFO L87 Difference]: Start difference. First operand 667 states and 843 transitions. Second operand 14 states. [2018-11-10 01:50:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:08,446 INFO L93 Difference]: Finished difference Result 689 states and 866 transitions. [2018-11-10 01:50:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:50:08,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-10 01:50:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:08,449 INFO L225 Difference]: With dead ends: 689 [2018-11-10 01:50:08,450 INFO L226 Difference]: Without dead ends: 657 [2018-11-10 01:50:08,450 INFO L605 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-10 01:50:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-10 01:50:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2018-11-10 01:50:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-10 01:50:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 828 transitions. [2018-11-10 01:50:08,488 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 828 transitions. Word has length 74 [2018-11-10 01:50:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:08,488 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 828 transitions. [2018-11-10 01:50:08,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:50:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 828 transitions. [2018-11-10 01:50:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 01:50:08,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:08,490 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-10 01:50:08,490 INFO L424 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:08,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1956424772, now seen corresponding path program 1 times [2018-11-10 01:50:08,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:08,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:08,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:08,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:08,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:08,600 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-10 01:50:08,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:08,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 01:50:08,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:50:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:50:08,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:50:08,601 INFO L87 Difference]: Start difference. First operand 657 states and 828 transitions. Second operand 14 states. [2018-11-10 01:50:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:08,756 INFO L93 Difference]: Finished difference Result 681 states and 854 transitions. [2018-11-10 01:50:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:50:08,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-10 01:50:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:08,757 INFO L225 Difference]: With dead ends: 681 [2018-11-10 01:50:08,757 INFO L226 Difference]: Without dead ends: 654 [2018-11-10 01:50:08,758 INFO L605 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-10 01:50:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-11-10 01:50:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2018-11-10 01:50:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-11-10 01:50:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 823 transitions. [2018-11-10 01:50:08,783 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 823 transitions. Word has length 70 [2018-11-10 01:50:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:08,783 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 823 transitions. [2018-11-10 01:50:08,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:50:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 823 transitions. [2018-11-10 01:50:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 01:50:08,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:08,784 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-10 01:50:08,784 INFO L424 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:08,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1597492846, now seen corresponding path program 1 times [2018-11-10 01:50:08,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:08,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:08,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:08,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:08,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:08,889 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-10 01:50:08,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:08,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 01:50:08,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:50:08,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:50:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:50:08,890 INFO L87 Difference]: Start difference. First operand 654 states and 823 transitions. Second operand 13 states. [2018-11-10 01:50:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:09,043 INFO L93 Difference]: Finished difference Result 674 states and 844 transitions. [2018-11-10 01:50:09,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 01:50:09,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-10 01:50:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:09,045 INFO L225 Difference]: With dead ends: 674 [2018-11-10 01:50:09,045 INFO L226 Difference]: Without dead ends: 652 [2018-11-10 01:50:09,045 INFO L605 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-10 01:50:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-11-10 01:50:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2018-11-10 01:50:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-10 01:50:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 819 transitions. [2018-11-10 01:50:09,071 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 819 transitions. Word has length 72 [2018-11-10 01:50:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:09,071 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 819 transitions. [2018-11-10 01:50:09,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:50:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 819 transitions. [2018-11-10 01:50:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 01:50:09,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:09,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-10 01:50:09,072 INFO L424 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:09,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1242279399, now seen corresponding path program 1 times [2018-11-10 01:50:09,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:09,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:09,172 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-10 01:50:09,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:09,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 01:50:09,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:50:09,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:50:09,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:50:09,173 INFO L87 Difference]: Start difference. First operand 652 states and 819 transitions. Second operand 13 states. [2018-11-10 01:50:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:09,319 INFO L93 Difference]: Finished difference Result 669 states and 837 transitions. [2018-11-10 01:50:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 01:50:09,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-10 01:50:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:09,320 INFO L225 Difference]: With dead ends: 669 [2018-11-10 01:50:09,320 INFO L226 Difference]: Without dead ends: 640 [2018-11-10 01:50:09,320 INFO L605 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-10 01:50:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-11-10 01:50:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2018-11-10 01:50:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-10 01:50:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 803 transitions. [2018-11-10 01:50:09,346 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 803 transitions. Word has length 69 [2018-11-10 01:50:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:09,346 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 803 transitions. [2018-11-10 01:50:09,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:50:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 803 transitions. [2018-11-10 01:50:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 01:50:09,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:09,347 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-10 01:50:09,347 INFO L424 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:09,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1917322660, now seen corresponding path program 1 times [2018-11-10 01:50:09,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:09,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:09,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:09,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:09,438 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-10 01:50:09,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:09,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 01:50:09,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:50:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:50:09,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:50:09,438 INFO L87 Difference]: Start difference. First operand 640 states and 803 transitions. Second operand 14 states. [2018-11-10 01:50:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:09,548 INFO L93 Difference]: Finished difference Result 704 states and 871 transitions. [2018-11-10 01:50:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:50:09,548 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-10 01:50:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:09,549 INFO L225 Difference]: With dead ends: 704 [2018-11-10 01:50:09,549 INFO L226 Difference]: Without dead ends: 633 [2018-11-10 01:50:09,550 INFO L605 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-10 01:50:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-11-10 01:50:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2018-11-10 01:50:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-11-10 01:50:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 792 transitions. [2018-11-10 01:50:09,574 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 792 transitions. Word has length 71 [2018-11-10 01:50:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:09,574 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 792 transitions. [2018-11-10 01:50:09,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:50:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 792 transitions. [2018-11-10 01:50:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 01:50:09,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:09,574 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-10 01:50:09,575 INFO L424 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:09,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash 283232897, now seen corresponding path program 1 times [2018-11-10 01:50:09,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:09,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:09,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:09,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:09,653 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-10 01:50:09,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:09,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 01:50:09,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:50:09,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:50:09,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:50:09,654 INFO L87 Difference]: Start difference. First operand 633 states and 792 transitions. Second operand 14 states. [2018-11-10 01:50:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:09,757 INFO L93 Difference]: Finished difference Result 697 states and 860 transitions. [2018-11-10 01:50:09,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:50:09,757 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-10 01:50:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:09,758 INFO L225 Difference]: With dead ends: 697 [2018-11-10 01:50:09,758 INFO L226 Difference]: Without dead ends: 627 [2018-11-10 01:50:09,759 INFO L605 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-10 01:50:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-10 01:50:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-11-10 01:50:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-10 01:50:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 783 transitions. [2018-11-10 01:50:09,783 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 783 transitions. Word has length 71 [2018-11-10 01:50:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:09,783 INFO L481 AbstractCegarLoop]: Abstraction has 627 states and 783 transitions. [2018-11-10 01:50:09,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:50:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 783 transitions. [2018-11-10 01:50:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 01:50:09,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:09,783 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-10 01:50:09,784 INFO L424 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:09,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1679420721, now seen corresponding path program 1 times [2018-11-10 01:50:09,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:09,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:09,825 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-10 01:50:09,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:09,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:09,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:09,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:09,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:09,826 INFO L87 Difference]: Start difference. First operand 627 states and 783 transitions. Second operand 11 states. [2018-11-10 01:50:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:09,903 INFO L93 Difference]: Finished difference Result 654 states and 813 transitions. [2018-11-10 01:50:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:09,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-10 01:50:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:09,905 INFO L225 Difference]: With dead ends: 654 [2018-11-10 01:50:09,905 INFO L226 Difference]: Without dead ends: 609 [2018-11-10 01:50:09,905 INFO L605 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-10 01:50:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-11-10 01:50:09,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2018-11-10 01:50:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-10 01:50:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 755 transitions. [2018-11-10 01:50:09,931 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 755 transitions. Word has length 72 [2018-11-10 01:50:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:09,932 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 755 transitions. [2018-11-10 01:50:09,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 755 transitions. [2018-11-10 01:50:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 01:50:09,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:09,933 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-10 01:50:09,933 INFO L424 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:09,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:09,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1765380645, now seen corresponding path program 1 times [2018-11-10 01:50:09,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:09,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:09,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:09,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:09,986 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-10 01:50:09,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:09,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:09,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:09,987 INFO L87 Difference]: Start difference. First operand 609 states and 755 transitions. Second operand 6 states. [2018-11-10 01:50:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:10,044 INFO L93 Difference]: Finished difference Result 650 states and 799 transitions. [2018-11-10 01:50:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:10,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-10 01:50:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:10,046 INFO L225 Difference]: With dead ends: 650 [2018-11-10 01:50:10,046 INFO L226 Difference]: Without dead ends: 614 [2018-11-10 01:50:10,047 INFO L605 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-10 01:50:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-10 01:50:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 609. [2018-11-10 01:50:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-10 01:50:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 753 transitions. [2018-11-10 01:50:10,079 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 753 transitions. Word has length 71 [2018-11-10 01:50:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:10,080 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 753 transitions. [2018-11-10 01:50:10,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 753 transitions. [2018-11-10 01:50:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 01:50:10,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:10,081 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-10 01:50:10,082 INFO L424 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:10,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2020113561, now seen corresponding path program 1 times [2018-11-10 01:50:10,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:10,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:10,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:10,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:10,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:10,217 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-10 01:50:10,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:10,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:10,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:10,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:10,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:10,218 INFO L87 Difference]: Start difference. First operand 609 states and 753 transitions. Second operand 11 states. [2018-11-10 01:50:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:10,369 INFO L93 Difference]: Finished difference Result 634 states and 780 transitions. [2018-11-10 01:50:10,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:10,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-10 01:50:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:10,370 INFO L225 Difference]: With dead ends: 634 [2018-11-10 01:50:10,371 INFO L226 Difference]: Without dead ends: 601 [2018-11-10 01:50:10,371 INFO L605 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-10 01:50:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-10 01:50:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-11-10 01:50:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-10 01:50:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 742 transitions. [2018-11-10 01:50:10,409 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 742 transitions. Word has length 71 [2018-11-10 01:50:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:10,409 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 742 transitions. [2018-11-10 01:50:10,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 742 transitions. [2018-11-10 01:50:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 01:50:10,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:10,410 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-10 01:50:10,410 INFO L424 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:10,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:10,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1006898934, now seen corresponding path program 1 times [2018-11-10 01:50:10,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:10,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:10,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:10,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:10,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:10,464 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-10 01:50:10,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:10,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 01:50:10,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 01:50:10,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 01:50:10,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:50:10,464 INFO L87 Difference]: Start difference. First operand 601 states and 742 transitions. Second operand 7 states. [2018-11-10 01:50:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:10,530 INFO L93 Difference]: Finished difference Result 655 states and 803 transitions. [2018-11-10 01:50:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:50:10,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-10 01:50:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:10,532 INFO L225 Difference]: With dead ends: 655 [2018-11-10 01:50:10,532 INFO L226 Difference]: Without dead ends: 599 [2018-11-10 01:50:10,532 INFO L605 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-10 01:50:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-11-10 01:50:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 595. [2018-11-10 01:50:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-11-10 01:50:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 732 transitions. [2018-11-10 01:50:10,555 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 732 transitions. Word has length 77 [2018-11-10 01:50:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:10,555 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 732 transitions. [2018-11-10 01:50:10,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 01:50:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 732 transitions. [2018-11-10 01:50:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 01:50:10,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:10,556 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-10 01:50:10,556 INFO L424 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:10,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2066807825, now seen corresponding path program 1 times [2018-11-10 01:50:10,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:10,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:10,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:10,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:10,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:10,658 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-10 01:50:10,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:10,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 01:50:10,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:50:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:50:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:50:10,659 INFO L87 Difference]: Start difference. First operand 595 states and 732 transitions. Second operand 14 states. [2018-11-10 01:50:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:10,764 INFO L93 Difference]: Finished difference Result 654 states and 794 transitions. [2018-11-10 01:50:10,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:50:10,764 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-10 01:50:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:10,766 INFO L225 Difference]: With dead ends: 654 [2018-11-10 01:50:10,766 INFO L226 Difference]: Without dead ends: 583 [2018-11-10 01:50:10,766 INFO L605 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-10 01:50:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-11-10 01:50:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2018-11-10 01:50:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-11-10 01:50:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 713 transitions. [2018-11-10 01:50:10,790 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 713 transitions. Word has length 72 [2018-11-10 01:50:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:10,790 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 713 transitions. [2018-11-10 01:50:10,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:50:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 713 transitions. [2018-11-10 01:50:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 01:50:10,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:10,792 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-10 01:50:10,792 INFO L424 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:10,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:10,792 INFO L82 PathProgramCache]: Analyzing trace with hash 806990906, now seen corresponding path program 1 times [2018-11-10 01:50:10,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:10,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:10,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:10,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:10,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:10,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-10 01:50:10,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:10,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:50:10,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:50:10,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:50:10,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:50:10,837 INFO L87 Difference]: Start difference. First operand 583 states and 713 transitions. Second operand 10 states. [2018-11-10 01:50:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:11,627 INFO L93 Difference]: Finished difference Result 1150 states and 1409 transitions. [2018-11-10 01:50:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:50:11,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-10 01:50:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:11,629 INFO L225 Difference]: With dead ends: 1150 [2018-11-10 01:50:11,629 INFO L226 Difference]: Without dead ends: 1005 [2018-11-10 01:50:11,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-10 01:50:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2018-11-10 01:50:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 924. [2018-11-10 01:50:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-11-10 01:50:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1154 transitions. [2018-11-10 01:50:11,668 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1154 transitions. Word has length 73 [2018-11-10 01:50:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:11,668 INFO L481 AbstractCegarLoop]: Abstraction has 924 states and 1154 transitions. [2018-11-10 01:50:11,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:50:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1154 transitions. [2018-11-10 01:50:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 01:50:11,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:11,669 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-10 01:50:11,669 INFO L424 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:11,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1486263160, now seen corresponding path program 1 times [2018-11-10 01:50:11,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:11,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:11,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:11,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:11,697 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-10 01:50:11,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:11,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:11,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:11,698 INFO L87 Difference]: Start difference. First operand 924 states and 1154 transitions. Second operand 6 states. [2018-11-10 01:50:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:12,065 INFO L93 Difference]: Finished difference Result 1153 states and 1407 transitions. [2018-11-10 01:50:12,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:50:12,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-10 01:50:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:12,066 INFO L225 Difference]: With dead ends: 1153 [2018-11-10 01:50:12,066 INFO L226 Difference]: Without dead ends: 1048 [2018-11-10 01:50:12,067 INFO L605 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-10 01:50:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-11-10 01:50:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 989. [2018-11-10 01:50:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2018-11-10 01:50:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1227 transitions. [2018-11-10 01:50:12,109 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1227 transitions. Word has length 73 [2018-11-10 01:50:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:12,109 INFO L481 AbstractCegarLoop]: Abstraction has 989 states and 1227 transitions. [2018-11-10 01:50:12,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1227 transitions. [2018-11-10 01:50:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 01:50:12,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:12,110 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-10 01:50:12,111 INFO L424 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:12,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:12,111 INFO L82 PathProgramCache]: Analyzing trace with hash 354205624, now seen corresponding path program 1 times [2018-11-10 01:50:12,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:12,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:12,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:12,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:12,149 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-10 01:50:12,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:12,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:12,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:12,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:12,150 INFO L87 Difference]: Start difference. First operand 989 states and 1227 transitions. Second operand 6 states. [2018-11-10 01:50:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:12,211 INFO L93 Difference]: Finished difference Result 1355 states and 1704 transitions. [2018-11-10 01:50:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:12,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-10 01:50:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:12,212 INFO L225 Difference]: With dead ends: 1355 [2018-11-10 01:50:12,212 INFO L226 Difference]: Without dead ends: 975 [2018-11-10 01:50:12,213 INFO L605 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-10 01:50:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-11-10 01:50:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2018-11-10 01:50:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2018-11-10 01:50:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1205 transitions. [2018-11-10 01:50:12,254 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1205 transitions. Word has length 77 [2018-11-10 01:50:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:12,254 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 1205 transitions. [2018-11-10 01:50:12,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1205 transitions. [2018-11-10 01:50:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 01:50:12,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:12,255 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-10 01:50:12,256 INFO L424 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:12,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:12,256 INFO L82 PathProgramCache]: Analyzing trace with hash 774162684, now seen corresponding path program 1 times [2018-11-10 01:50:12,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:12,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:12,298 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-10 01:50:12,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:12,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:12,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:12,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:12,299 INFO L87 Difference]: Start difference. First operand 975 states and 1205 transitions. Second operand 5 states. [2018-11-10 01:50:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:12,348 INFO L93 Difference]: Finished difference Result 1020 states and 1253 transitions. [2018-11-10 01:50:12,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:12,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-10 01:50:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:12,349 INFO L225 Difference]: With dead ends: 1020 [2018-11-10 01:50:12,349 INFO L226 Difference]: Without dead ends: 975 [2018-11-10 01:50:12,350 INFO L605 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-10 01:50:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-11-10 01:50:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2018-11-10 01:50:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2018-11-10 01:50:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1203 transitions. [2018-11-10 01:50:12,391 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1203 transitions. Word has length 75 [2018-11-10 01:50:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:12,391 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 1203 transitions. [2018-11-10 01:50:12,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1203 transitions. [2018-11-10 01:50:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 01:50:12,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:12,392 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-10 01:50:12,392 INFO L424 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:12,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:12,393 INFO L82 PathProgramCache]: Analyzing trace with hash 796794938, now seen corresponding path program 1 times [2018-11-10 01:50:12,393 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:12,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:12,430 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-10 01:50:12,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:12,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:12,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:12,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:12,431 INFO L87 Difference]: Start difference. First operand 975 states and 1203 transitions. Second operand 6 states. [2018-11-10 01:50:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:12,483 INFO L93 Difference]: Finished difference Result 1016 states and 1245 transitions. [2018-11-10 01:50:12,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:12,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-10 01:50:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:12,485 INFO L225 Difference]: With dead ends: 1016 [2018-11-10 01:50:12,485 INFO L226 Difference]: Without dead ends: 975 [2018-11-10 01:50:12,485 INFO L605 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-10 01:50:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-11-10 01:50:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2018-11-10 01:50:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2018-11-10 01:50:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1201 transitions. [2018-11-10 01:50:12,528 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1201 transitions. Word has length 75 [2018-11-10 01:50:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:12,528 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 1201 transitions. [2018-11-10 01:50:12,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1201 transitions. [2018-11-10 01:50:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 01:50:12,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:12,529 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-10 01:50:12,529 INFO L424 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:12,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash 287321848, now seen corresponding path program 1 times [2018-11-10 01:50:12,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:12,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:12,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:12,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:12,600 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-10 01:50:12,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:12,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:12,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:12,600 INFO L87 Difference]: Start difference. First operand 975 states and 1201 transitions. Second operand 11 states. [2018-11-10 01:50:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:12,705 INFO L93 Difference]: Finished difference Result 997 states and 1224 transitions. [2018-11-10 01:50:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:12,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-10 01:50:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:12,706 INFO L225 Difference]: With dead ends: 997 [2018-11-10 01:50:12,706 INFO L226 Difference]: Without dead ends: 939 [2018-11-10 01:50:12,707 INFO L605 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-10 01:50:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-11-10 01:50:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 933. [2018-11-10 01:50:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-11-10 01:50:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1149 transitions. [2018-11-10 01:50:12,746 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1149 transitions. Word has length 75 [2018-11-10 01:50:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:12,746 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1149 transitions. [2018-11-10 01:50:12,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1149 transitions. [2018-11-10 01:50:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 01:50:12,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:12,747 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-10 01:50:12,747 INFO L424 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:12,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1835021096, now seen corresponding path program 1 times [2018-11-10 01:50:12,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:12,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:12,767 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-10 01:50:12,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:12,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:50:12,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:50:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:50:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:50:12,767 INFO L87 Difference]: Start difference. First operand 933 states and 1149 transitions. Second operand 3 states. [2018-11-10 01:50:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:12,815 INFO L93 Difference]: Finished difference Result 996 states and 1217 transitions. [2018-11-10 01:50:12,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:50:12,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-10 01:50:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:12,817 INFO L225 Difference]: With dead ends: 996 [2018-11-10 01:50:12,817 INFO L226 Difference]: Without dead ends: 943 [2018-11-10 01:50:12,817 INFO L605 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-10 01:50:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-11-10 01:50:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 935. [2018-11-10 01:50:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2018-11-10 01:50:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1151 transitions. [2018-11-10 01:50:12,856 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1151 transitions. Word has length 80 [2018-11-10 01:50:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:12,857 INFO L481 AbstractCegarLoop]: Abstraction has 935 states and 1151 transitions. [2018-11-10 01:50:12,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:50:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1151 transitions. [2018-11-10 01:50:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 01:50:12,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:12,857 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-10 01:50:12,858 INFO L424 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:12,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash 215962902, now seen corresponding path program 1 times [2018-11-10 01:50:12,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:12,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:12,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:12,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:50:12,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:12,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 01:50:12,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:50:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:50:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:50:12,928 INFO L87 Difference]: Start difference. First operand 935 states and 1151 transitions. Second operand 14 states. [2018-11-10 01:50:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:13,041 INFO L93 Difference]: Finished difference Result 963 states and 1180 transitions. [2018-11-10 01:50:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:50:13,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-10 01:50:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:13,043 INFO L225 Difference]: With dead ends: 963 [2018-11-10 01:50:13,043 INFO L226 Difference]: Without dead ends: 923 [2018-11-10 01:50:13,043 INFO L605 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-10 01:50:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-10 01:50:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-11-10 01:50:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-10 01:50:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1131 transitions. [2018-11-10 01:50:13,082 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1131 transitions. Word has length 80 [2018-11-10 01:50:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:13,082 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1131 transitions. [2018-11-10 01:50:13,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:50:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1131 transitions. [2018-11-10 01:50:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 01:50:13,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:13,083 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-10 01:50:13,083 INFO L424 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:13,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:13,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1708498808, now seen corresponding path program 1 times [2018-11-10 01:50:13,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:13,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:13,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:13,177 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-10 01:50:13,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:13,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 01:50:13,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:50:13,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:50:13,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:50:13,178 INFO L87 Difference]: Start difference. First operand 923 states and 1131 transitions. Second operand 14 states. [2018-11-10 01:50:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:13,281 INFO L93 Difference]: Finished difference Result 938 states and 1147 transitions. [2018-11-10 01:50:13,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:50:13,281 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-10 01:50:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:13,282 INFO L225 Difference]: With dead ends: 938 [2018-11-10 01:50:13,282 INFO L226 Difference]: Without dead ends: 850 [2018-11-10 01:50:13,283 INFO L605 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-10 01:50:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-11-10 01:50:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2018-11-10 01:50:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 01:50:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1051 transitions. [2018-11-10 01:50:13,324 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1051 transitions. Word has length 77 [2018-11-10 01:50:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:13,324 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1051 transitions. [2018-11-10 01:50:13,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:50:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1051 transitions. [2018-11-10 01:50:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 01:50:13,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:13,325 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-10 01:50:13,325 INFO L424 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:13,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1468939873, now seen corresponding path program 1 times [2018-11-10 01:50:13,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:13,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:13,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:50:13,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:13,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:13,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:13,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:13,375 INFO L87 Difference]: Start difference. First operand 850 states and 1051 transitions. Second operand 5 states. [2018-11-10 01:50:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:13,587 INFO L93 Difference]: Finished difference Result 1216 states and 1528 transitions. [2018-11-10 01:50:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:13,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-10 01:50:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:13,589 INFO L225 Difference]: With dead ends: 1216 [2018-11-10 01:50:13,589 INFO L226 Difference]: Without dead ends: 850 [2018-11-10 01:50:13,590 INFO L605 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-10 01:50:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-11-10 01:50:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2018-11-10 01:50:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 01:50:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1049 transitions. [2018-11-10 01:50:13,651 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1049 transitions. Word has length 81 [2018-11-10 01:50:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:13,652 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1049 transitions. [2018-11-10 01:50:13,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1049 transitions. [2018-11-10 01:50:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 01:50:13,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:13,657 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-10 01:50:13,657 INFO L424 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:13,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1129636383, now seen corresponding path program 1 times [2018-11-10 01:50:13,658 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:13,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:13,730 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-10 01:50:13,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:13,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:50:13,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:50:13,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:50:13,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:50:13,731 INFO L87 Difference]: Start difference. First operand 850 states and 1049 transitions. Second operand 10 states. [2018-11-10 01:50:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:14,512 INFO L93 Difference]: Finished difference Result 915 states and 1114 transitions. [2018-11-10 01:50:14,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:50:14,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-10 01:50:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:14,513 INFO L225 Difference]: With dead ends: 915 [2018-11-10 01:50:14,513 INFO L226 Difference]: Without dead ends: 782 [2018-11-10 01:50:14,514 INFO L605 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-10 01:50:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-11-10 01:50:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 390. [2018-11-10 01:50:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-10 01:50:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 481 transitions. [2018-11-10 01:50:14,537 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 481 transitions. Word has length 78 [2018-11-10 01:50:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:14,537 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 481 transitions. [2018-11-10 01:50:14,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:50:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 481 transitions. [2018-11-10 01:50:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 01:50:14,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:14,538 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-10 01:50:14,538 INFO L424 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:14,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash 772709398, now seen corresponding path program 1 times [2018-11-10 01:50:14,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:14,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:14,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:14,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:14,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:14,643 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-10 01:50:14,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:14,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 01:50:14,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:50:14,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:50:14,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:50:14,644 INFO L87 Difference]: Start difference. First operand 390 states and 481 transitions. Second operand 13 states. [2018-11-10 01:50:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:14,756 INFO L93 Difference]: Finished difference Result 392 states and 482 transitions. [2018-11-10 01:50:14,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 01:50:14,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-10 01:50:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:14,756 INFO L225 Difference]: With dead ends: 392 [2018-11-10 01:50:14,756 INFO L226 Difference]: Without dead ends: 313 [2018-11-10 01:50:14,757 INFO L605 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-10 01:50:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-10 01:50:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-11-10 01:50:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-10 01:50:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 391 transitions. [2018-11-10 01:50:14,776 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 391 transitions. Word has length 79 [2018-11-10 01:50:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:14,776 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 391 transitions. [2018-11-10 01:50:14,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:50:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 391 transitions. [2018-11-10 01:50:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 01:50:14,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:14,777 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-10 01:50:14,777 INFO L424 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:14,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash 147020346, now seen corresponding path program 1 times [2018-11-10 01:50:14,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:14,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:14,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:14,807 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-10 01:50:14,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:14,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:50:14,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:14,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:14,808 INFO L87 Difference]: Start difference. First operand 313 states and 391 transitions. Second operand 6 states. [2018-11-10 01:50:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:14,926 INFO L93 Difference]: Finished difference Result 449 states and 550 transitions. [2018-11-10 01:50:14,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:50:14,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-10 01:50:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:14,928 INFO L225 Difference]: With dead ends: 449 [2018-11-10 01:50:14,928 INFO L226 Difference]: Without dead ends: 305 [2018-11-10 01:50:14,928 INFO L605 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-10 01:50:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-10 01:50:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 258. [2018-11-10 01:50:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 01:50:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 302 transitions. [2018-11-10 01:50:14,945 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 302 transitions. Word has length 83 [2018-11-10 01:50:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:14,945 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 302 transitions. [2018-11-10 01:50:14,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 302 transitions. [2018-11-10 01:50:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 01:50:14,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:14,946 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-10 01:50:14,946 INFO L424 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:14,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1296665093, now seen corresponding path program 1 times [2018-11-10 01:50:14,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:14,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:14,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:15,025 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-10 01:50:15,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:15,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 01:50:15,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:50:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:50:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:50:15,025 INFO L87 Difference]: Start difference. First operand 258 states and 302 transitions. Second operand 13 states. [2018-11-10 01:50:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:15,479 INFO L93 Difference]: Finished difference Result 290 states and 339 transitions. [2018-11-10 01:50:15,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 01:50:15,479 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-10 01:50:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:15,479 INFO L225 Difference]: With dead ends: 290 [2018-11-10 01:50:15,479 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 01:50:15,480 INFO L605 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-10 01:50:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 01:50:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 258. [2018-11-10 01:50:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 01:50:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 301 transitions. [2018-11-10 01:50:15,495 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 301 transitions. Word has length 99 [2018-11-10 01:50:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:15,495 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 301 transitions. [2018-11-10 01:50:15,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:50:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 301 transitions. [2018-11-10 01:50:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 01:50:15,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:15,495 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-10 01:50:15,495 INFO L424 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:15,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1655328265, now seen corresponding path program 1 times [2018-11-10 01:50:15,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:15,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:15,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:15,534 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-10 01:50:15,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:15,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:50:15,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:50:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:50:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:50:15,535 INFO L87 Difference]: Start difference. First operand 258 states and 301 transitions. Second operand 10 states. [2018-11-10 01:50:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:16,035 INFO L93 Difference]: Finished difference Result 553 states and 643 transitions. [2018-11-10 01:50:16,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 01:50:16,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-11-10 01:50:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:16,037 INFO L225 Difference]: With dead ends: 553 [2018-11-10 01:50:16,037 INFO L226 Difference]: Without dead ends: 493 [2018-11-10 01:50:16,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-11-10 01:50:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-11-10 01:50:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 449. [2018-11-10 01:50:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-10 01:50:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 523 transitions. [2018-11-10 01:50:16,061 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 523 transitions. Word has length 101 [2018-11-10 01:50:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:16,061 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 523 transitions. [2018-11-10 01:50:16,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:50:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 523 transitions. [2018-11-10 01:50:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 01:50:16,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:16,062 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-10 01:50:16,062 INFO L424 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:16,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1645644328, now seen corresponding path program 1 times [2018-11-10 01:50:16,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:16,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:16,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:16,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:16,100 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-10 01:50:16,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:50:16,100 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/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-10 01:50:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:16,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:16,248 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-10 01:50:16,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:50:16,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-10 01:50:16,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:50:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:50:16,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:50:16,277 INFO L87 Difference]: Start difference. First operand 449 states and 523 transitions. Second operand 6 states. [2018-11-10 01:50:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:16,741 INFO L93 Difference]: Finished difference Result 698 states and 845 transitions. [2018-11-10 01:50:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:50:16,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-11-10 01:50:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:16,743 INFO L225 Difference]: With dead ends: 698 [2018-11-10 01:50:16,743 INFO L226 Difference]: Without dead ends: 420 [2018-11-10 01:50:16,744 INFO L605 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-10 01:50:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-11-10 01:50:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 377. [2018-11-10 01:50:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-10 01:50:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 434 transitions. [2018-11-10 01:50:16,801 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 434 transitions. Word has length 114 [2018-11-10 01:50:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:16,801 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 434 transitions. [2018-11-10 01:50:16,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:50:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 434 transitions. [2018-11-10 01:50:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 01:50:16,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:50:16,803 INFO L424 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:16,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash 221734965, now seen corresponding path program 1 times [2018-11-10 01:50:16,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:16,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:16,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:16,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:16,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:16,896 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-10 01:50:16,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:16,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 01:50:16,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 01:50:16,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 01:50:16,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:50:16,897 INFO L87 Difference]: Start difference. First operand 377 states and 434 transitions. Second operand 8 states. [2018-11-10 01:50:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:16,994 INFO L93 Difference]: Finished difference Result 395 states and 453 transitions. [2018-11-10 01:50:16,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:50:16,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-10 01:50:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:16,997 INFO L225 Difference]: With dead ends: 395 [2018-11-10 01:50:16,998 INFO L226 Difference]: Without dead ends: 288 [2018-11-10 01:50:16,998 INFO L605 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-10 01:50:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-10 01:50:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 151. [2018-11-10 01:50:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 01:50:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2018-11-10 01:50:17,021 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 101 [2018-11-10 01:50:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:17,022 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2018-11-10 01:50:17,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 01:50:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2018-11-10 01:50:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 01:50:17,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:17,022 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-10 01:50:17,023 INFO L424 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:17,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash -426361306, now seen corresponding path program 1 times [2018-11-10 01:50:17,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:17,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:17,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:17,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:17,137 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-10 01:50:17,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:17,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:17,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:17,138 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 11 states. [2018-11-10 01:50:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:17,645 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2018-11-10 01:50:17,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:50:17,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-11-10 01:50:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:17,648 INFO L225 Difference]: With dead ends: 173 [2018-11-10 01:50:17,648 INFO L226 Difference]: Without dead ends: 149 [2018-11-10 01:50:17,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-10 01:50:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-10 01:50:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-11-10 01:50:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 01:50:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-11-10 01:50:17,669 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 115 [2018-11-10 01:50:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:17,669 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-11-10 01:50:17,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-11-10 01:50:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 01:50:17,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:17,670 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-10 01:50:17,670 INFO L424 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:17,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash 346903781, now seen corresponding path program 1 times [2018-11-10 01:50:17,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:17,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:17,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:17,750 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-10 01:50:17,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:17,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:50:17,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:50:17,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:50:17,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:50:17,751 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 9 states. [2018-11-10 01:50:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:18,194 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-11-10 01:50:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:50:18,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-11-10 01:50:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:18,195 INFO L225 Difference]: With dead ends: 280 [2018-11-10 01:50:18,195 INFO L226 Difference]: Without dead ends: 146 [2018-11-10 01:50:18,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:50:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-10 01:50:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-10 01:50:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 01:50:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-11-10 01:50:18,215 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 116 [2018-11-10 01:50:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:18,215 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-11-10 01:50:18,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:50:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-11-10 01:50:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 01:50:18,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:18,216 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-10 01:50:18,216 INFO L424 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:18,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash 465345255, now seen corresponding path program 1 times [2018-11-10 01:50:18,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:18,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:18,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:18,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:18,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:18,294 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-10 01:50:18,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:18,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:50:18,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:50:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:50:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:50:18,295 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 3 states. [2018-11-10 01:50:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:18,325 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2018-11-10 01:50:18,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:50:18,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-10 01:50:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:18,327 INFO L225 Difference]: With dead ends: 192 [2018-11-10 01:50:18,327 INFO L226 Difference]: Without dead ends: 158 [2018-11-10 01:50:18,328 INFO L605 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-10 01:50:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-10 01:50:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-11-10 01:50:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-10 01:50:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-11-10 01:50:18,353 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2018-11-10 01:50:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:18,354 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-11-10 01:50:18,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:50:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-11-10 01:50:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 01:50:18,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:18,354 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-10 01:50:18,355 INFO L424 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:18,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash -983424726, now seen corresponding path program 1 times [2018-11-10 01:50:18,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:50:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:50:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:18,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:50:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:18,428 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-10 01:50:18,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:18,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:50:18,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:50:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:50:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:50:18,429 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 11 states. [2018-11-10 01:50:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:18,829 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-11-10 01:50:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:50:18,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-11-10 01:50:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:18,830 INFO L225 Difference]: With dead ends: 152 [2018-11-10 01:50:18,830 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 01:50:18,831 INFO L605 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-10 01:50:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 01:50:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 01:50:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 01:50:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 01:50:18,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2018-11-10 01:50:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:18,831 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:50:18,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:50:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 01:50:18,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 01:50:18,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 01:50:18,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:18,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:19,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 01:50:20,776 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 1 [2018-11-10 01:50:21,069 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2018-11-10 01:50:21,444 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 93 [2018-11-10 01:50:21,625 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2018-11-10 01:50:22,152 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 91 [2018-11-10 01:50:22,932 WARN L179 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 96 [2018-11-10 01:50:23,164 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 56 [2018-11-10 01:50:23,446 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 88 [2018-11-10 01:50:23,630 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 58 [2018-11-10 01:50:23,735 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2018-11-10 01:50:23,973 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2018-11-10 01:50:24,180 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2018-11-10 01:50:24,920 WARN L179 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 91 [2018-11-10 01:50:25,378 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-11-10 01:50:26,001 WARN L179 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 96 [2018-11-10 01:50:26,586 WARN L179 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 93 [2018-11-10 01:50:26,756 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2018-11-10 01:50:27,106 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 77 [2018-11-10 01:50:27,294 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2018-11-10 01:50:27,457 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2018-11-10 01:50:27,694 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2018-11-10 01:50:27,876 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2018-11-10 01:50:28,307 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-11-10 01:50:28,544 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 69 [2018-11-10 01:50:29,016 WARN L179 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 96 [2018-11-10 01:50:29,591 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2018-11-10 01:50:29,751 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-11-10 01:50:30,001 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-10 01:50:30,734 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2018-11-10 01:50:31,270 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 82 [2018-11-10 01:50:31,509 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2018-11-10 01:50:31,860 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 79 [2018-11-10 01:50:31,992 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 1 [2018-11-10 01:50:32,202 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 76 [2018-11-10 01:50:32,692 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 91 [2018-11-10 01:50:32,905 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2018-11-10 01:50:33,789 WARN L179 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 96 [2018-11-10 01:50:34,446 WARN L179 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 93 [2018-11-10 01:50:35,106 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2018-11-10 01:50:35,325 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2018-11-10 01:50:35,436 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2018-11-10 01:50:35,553 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-11-10 01:50:35,930 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2018-11-10 01:50:36,144 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2018-11-10 01:50:36,521 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 82 [2018-11-10 01:50:36,831 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2018-11-10 01:50:37,126 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 82 [2018-11-10 01:50:37,337 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2018-11-10 01:50:37,872 WARN L179 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 90 [2018-11-10 01:50:38,207 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 82 [2018-11-10 01:50:38,475 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 73 [2018-11-10 01:50:38,712 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2018-11-10 01:50:39,150 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 76 [2018-11-10 01:50:39,366 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2018-11-10 01:50:39,827 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2018-11-10 01:50:40,022 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2018-11-10 01:50:40,131 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-10 01:50:40,546 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2018-11-10 01:50:41,152 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 68 [2018-11-10 01:50:41,336 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-11-10 01:50:41,555 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 71 [2018-11-10 01:50:41,841 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 84 [2018-11-10 01:50:42,219 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2018-11-10 01:50:42,477 INFO L425 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 84 129) no Hoare annotation was computed. [2018-11-10 01:50:42,477 INFO L421 ceAbstractionStarter]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0)) (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5) (not (= |old(~customIrp~0)| 0))) (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5))))) [2018-11-10 01:50:42,477 INFO L425 ceAbstractionStarter]: For program point L122-1(line 122) no Hoare annotation was computed. [2018-11-10 01:50:42,477 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 125) no Hoare annotation was computed. [2018-11-10 01:50:42,477 INFO L425 ceAbstractionStarter]: For program point L120-2(lines 120 125) no Hoare annotation was computed. [2018-11-10 01:50:42,477 INFO L421 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 84 129) the Hoare annotation is: (let ((.cse6 (= |old(~s~0)| ~s~0)) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 (or .cse1 .cse2 (not (= ~compRegistered~0 0))) (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5)) .cse6) (or (and .cse6 (= |old(~customIrp~0)| ~customIrp~0)) (or .cse0 (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~myStatus~0 0)) (or .cse1 .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) .cse5) (not (= |old(~customIrp~0)| 0))))) [2018-11-10 01:50:42,477 INFO L425 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 84 129) no Hoare annotation was computed. [2018-11-10 01:50:42,477 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 114) no Hoare annotation was computed. [2018-11-10 01:50:42,477 INFO L425 ceAbstractionStarter]: For program point L102-2(lines 100 128) no Hoare annotation was computed. [2018-11-10 01:50:42,477 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 62 83) no Hoare annotation was computed. [2018-11-10 01:50:42,478 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-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 62 83) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point L172(lines 171 188) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L421 ceAbstractionStarter]: At program point L189(lines 161 199) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))))) (and (or .cse0 (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))) (or .cse1 .cse0))))) [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 140 216) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 204) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 168) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L421 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 140 216) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse0 (< 0 .cse10))) (let ((.cse1 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|)))) (and (or .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 0) .cse11 .cse12) (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12)))) (.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and .cse2 (= |old(~customIrp~0)| ~customIrp~0)) (< ~myStatus~0 0) (not (= |old(~customIrp~0)| 0))))))) [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point L161(lines 161 199) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 140 216) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point L161-2(lines 161 199) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 159) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-10 01:50:42,478 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 180) no Hoare annotation was computed. [2018-11-10 01:50:42,479 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 209) no Hoare annotation was computed. [2018-11-10 01:50:42,479 INFO L421 ceAbstractionStarter]: At program point L207-2(lines 207 209) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))))) (and (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 (not (= |old(~customIrp~0)| 0))) (or .cse1 .cse0))))) [2018-11-10 01:50:42,479 INFO L421 ceAbstractionStarter]: At program point L154(line 154) the Hoare annotation is: (let ((.cse10 (+ ~myStatus~0 1073741637))) (let ((.cse0 (< 0 .cse10))) (let ((.cse1 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (not (= 0 |old(~pended~0)|)))) (and (or .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 0) .cse11 .cse12) (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12)))) (.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and .cse2 (= |old(~customIrp~0)| ~customIrp~0)) (< ~myStatus~0 0) (not (= |old(~customIrp~0)| 0))))))) [2018-11-10 01:50:42,479 INFO L425 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-11-10 01:50:42,479 INFO L425 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-10 01:50:42,479 INFO L421 ceAbstractionStarter]: At program point L175(lines 175 183) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))))) (and (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 (not (= |old(~customIrp~0)| 0))) (or .cse1 .cse0))))) [2018-11-10 01:50:42,479 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 171 188) no Hoare annotation was computed. [2018-11-10 01:50:42,479 INFO L421 ceAbstractionStarter]: At program point L171-3(lines 171 188) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))))) (and (or (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) .cse0 (not (= |old(~customIrp~0)| 0))) (or .cse1 .cse0))))) [2018-11-10 01:50:42,479 INFO L425 ceAbstractionStarter]: For program point L882-2(lines 882 884) no Hoare annotation was computed. [2018-11-10 01:50:42,479 INFO L421 ceAbstractionStarter]: At program point AG_SetStatusAndReturnENTRY(lines 876 892) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))))) (and (or (= ~myStatus~0 |old(~myStatus~0)|) (or .cse0 .cse1 .cse2 .cse3 (< ~IPC~0 (+ ~SKIP2~0 3)) .cse4 .cse5 .cse6)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |old(~s~0)| ~s~0) (< ~IPC~0 (+ ~DC~0 5)) .cse6))) [2018-11-10 01:50:42,479 INFO L425 ceAbstractionStarter]: For program point AG_SetStatusAndReturnEXIT(lines 876 892) no Hoare annotation was computed. [2018-11-10 01:50:42,479 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse8 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 AG_SetStatusAndReturn_~status)) (.cse10 (or (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0))))) (and (let ((.cse4 (= |old(~s~0)| ~s~0)) (.cse5 (<= |AG_SetStatusAndReturn_#in~status| AG_SetStatusAndReturn_~__cil_tmp4~0)) (.cse6 (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|))) (or .cse0 .cse1 .cse2 .cse3 (and (or (<= 2147483670 |AG_SetStatusAndReturn_#in~status|) (<= (+ |AG_SetStatusAndReturn_#in~status| 2147483626) 0)) .cse4 .cse5 (<= AG_SetStatusAndReturn_~__cil_tmp4~0 |AG_SetStatusAndReturn_#in~status|) .cse6) .cse7 (and .cse4 .cse5 .cse8 .cse6) .cse9 (< ~IPC~0 (+ ~DC~0 5)) .cse10)) (or .cse0 .cse1 .cse9 .cse2 .cse3 (< ~IPC~0 (+ ~SKIP2~0 3)) .cse7 .cse8 .cse10))) [2018-11-10 01:50:42,479 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-10 01:50:42,479 INFO L425 ceAbstractionStarter]: For program point AG_SetStatusAndReturnFINAL(lines 876 892) no Hoare annotation was computed. [2018-11-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point L882(lines 882 884) no Hoare annotation was computed. [2018-11-10 01:50:42,480 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 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0)) (let ((.cse9 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse9) .cse6 .cse7 .cse8 (<= .cse9 0))))) (= |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-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1716 1878) no Hoare annotation was computed. [2018-11-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point L1844(lines 1844 1850) no Hoare annotation was computed. [2018-11-10 01:50:42,480 INFO L421 ceAbstractionStarter]: At program point L1820(line 1820) the Hoare annotation is: (let ((.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse9 (= 0 main_~status~9)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse5 (= ~lowerDriverReturn~0 main_~status~9)) (.cse7 (and (= 0 ~pended~0) .cse1))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (= ~routine~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ~compRegistered~0) .cse6) (and (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse3 (and .cse0 .cse4 .cse7)) (not (= 259 main_~status~9))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse3 .cse8 .cse4 .cse5 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7) (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)|)) (and .cse9 .cse8 .cse5 .cse7) (not (= |old(~customIrp~0)| 0))))) [2018-11-10 01:50:42,480 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-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point L1754-1(lines 1726 1877) no Hoare annotation was computed. [2018-11-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point L1771(lines 1756 1823) no Hoare annotation was computed. [2018-11-10 01:50:42,480 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-10 01:50:42,480 INFO L421 ceAbstractionStarter]: At program point L1813(lines 1756 1823) the Hoare annotation is: (let ((.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse9 (= 0 main_~status~9)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse5 (= ~lowerDriverReturn~0 main_~status~9)) (.cse7 (and (= 0 ~pended~0) .cse1))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (= ~routine~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ~compRegistered~0) .cse6) (and (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse3 (and .cse0 .cse4 .cse7)) (not (= 259 main_~status~9))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse3 .cse8 .cse4 .cse5 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7) (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)|)) (and .cse9 .cse8 .cse5 .cse7) (not (= |old(~customIrp~0)| 0))))) [2018-11-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point L1780(lines 1780 1817) no Hoare annotation was computed. [2018-11-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1794 1814) no Hoare annotation was computed. [2018-11-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 1716 1878) no Hoare annotation was computed. [2018-11-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 1794 1814) no Hoare annotation was computed. [2018-11-10 01:50:42,480 INFO L425 ceAbstractionStarter]: For program point L1797(line 1797) no Hoare annotation was computed. [2018-11-10 01:50:42,481 INFO L421 ceAbstractionStarter]: At program point L1855(lines 1842 1871) the Hoare annotation is: (let ((.cse2 (= ~lowerDriverReturn~0 main_~status~9)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (and (let ((.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and .cse3 .cse4 (and .cse1 .cse2)) (and (and .cse3 .cse4 .cse1) (= ~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)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 main_~status~9) .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 259 main_~status~9)) (and (<= ~s~0 ~DC~0) (<= (+ ~DC~0 5) ~IPC~0) .cse0)) (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-10 01:50:42,481 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-10 01:50:42,481 INFO L425 ceAbstractionStarter]: For program point L1756(lines 1726 1877) no Hoare annotation was computed. [2018-11-10 01:50:42,481 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 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0)) (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)) (let ((.cse9 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse9) .cse6 .cse7 .cse8 (<= .cse9 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-10 01:50:42,481 INFO L421 ceAbstractionStarter]: At program point L1839(lines 1832 1874) the Hoare annotation is: (let ((.cse0 (= 0 main_~status~9)) (.cse3 (= ~IPC~0 ~s~0)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse1 (= ~lowerDriverReturn~0 main_~status~9)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0))) (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 .cse0 .cse4 .cse1 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse5 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse6 .cse7 .cse1 .cse2 .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse5 .cse6 .cse4 .cse7 .cse1 .cse2) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and (not (= 259 main_~status~9)) (and (= ~DC~0 ~s~0) (<= (+ ~DC~0 5) ~IPC~0) .cse6 (and .cse5 .cse7 .cse2))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-10 01:50:42,481 INFO L425 ceAbstractionStarter]: For program point L1864(lines 1864 1868) no Hoare annotation was computed. [2018-11-10 01:50:42,481 INFO L421 ceAbstractionStarter]: At program point L1831(lines 1824 1875) the Hoare annotation is: (let ((.cse7 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse2 (= ~SKIP2~0 ~s~0)) (.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse8 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= 0 main_~status~9)) (.cse1 (and .cse7 (= 0 ~pended~0))) (.cse3 (= ~lowerDriverReturn~0 main_~status~9)) (.cse9 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .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)|)) (not (= |old(~compRegistered~0)| 0)) (= ~UNLOADED~0 ~s~0) (and .cse4 .cse1 .cse5 .cse2 .cse6 .cse3) (and .cse4 .cse7 (= ~routine~0 0) .cse8 .cse5 .cse6 .cse3 (<= 1 ~compRegistered~0) .cse9) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 259 main_~status~9)) (and (= ~DC~0 ~s~0) (and .cse4 .cse1 .cse6) (<= (+ ~DC~0 5) ~IPC~0) .cse5)) (not (= 0 |old(~pended~0)|)) (and .cse4 .cse1 .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse0 .cse1 .cse3 .cse9) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-10 01:50:42,481 INFO L425 ceAbstractionStarter]: For program point L1790(lines 1790 1815) no Hoare annotation was computed. [2018-11-10 01:50:42,481 INFO L425 ceAbstractionStarter]: For program point L1840(lines 1824 1875) no Hoare annotation was computed. [2018-11-10 01:50:42,481 INFO L425 ceAbstractionStarter]: For program point L1807(line 1807) no Hoare annotation was computed. [2018-11-10 01:50:42,481 INFO L425 ceAbstractionStarter]: For program point L1766(lines 1766 1769) no Hoare annotation was computed. [2018-11-10 01:50:42,481 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 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0)) (let ((.cse9 (+ ~myStatus~0 1073741637))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 .cse9) .cse6 .cse7 .cse8 (<= .cse9 0))))) (= |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-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1857(lines 1857 1869) no Hoare annotation was computed. [2018-11-10 01:50:42,482 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-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1841(lines 1841 1872) no Hoare annotation was computed. [2018-11-10 01:50:42,482 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-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1833(lines 1833 1837) no Hoare annotation was computed. [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1858(lines 1858 1862) no Hoare annotation was computed. [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1825(lines 1825 1829) no Hoare annotation was computed. [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1842(lines 1842 1871) no Hoare annotation was computed. [2018-11-10 01:50:42,482 INFO L428 ceAbstractionStarter]: At program point L1793(lines 1792 1815) the Hoare annotation is: true [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1785(lines 1785 1816) no Hoare annotation was computed. [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1843(lines 1843 1853) no Hoare annotation was computed. [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1802(line 1802) no Hoare annotation was computed. [2018-11-10 01:50:42,482 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-10 01:50:42,482 INFO L421 ceAbstractionStarter]: At program point L1887(line 1887) the Hoare annotation is: (or (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 1 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 ~pended~0))) (.cse10 (< ~compRegistered~0 1))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= ~customIrp~0 0))) [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L1887-1(lines 1879 1892) no Hoare annotation was computed. [2018-11-10 01:50:42,482 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 1879 1892) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (or (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 1 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 ~pended~0))) (.cse10 (< ~compRegistered~0 1))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= ~customIrp~0 0)))) [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 1879 1892) no Hoare annotation was computed. [2018-11-10 01:50:42,482 INFO L425 ceAbstractionStarter]: For program point L2079(lines 2079 2096) no Hoare annotation was computed. [2018-11-10 01:50:42,482 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-10 01:50:42,483 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-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 2042 2126) no Hoare annotation was computed. [2018-11-10 01:50:42,483 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-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2059-1(line 2059) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2051(lines 2051 2071) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2051-1(lines 2051 2071) no Hoare annotation was computed. [2018-11-10 01:50:42,483 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-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 2042 2126) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-11-10 01:50:42,483 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-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2052(lines 2052 2062) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2114(lines 2114 2121) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2102(lines 2102 2122) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2065(lines 2065 2069) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 2083 2095) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point $Ultimate##17(lines 2083 2095) no Hoare annotation was computed. [2018-11-10 01:50:42,483 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-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2057(lines 2057 2061) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2057-2(lines 2052 2062) no Hoare annotation was computed. [2018-11-10 01:50:42,483 INFO L425 ceAbstractionStarter]: For program point L2119-1(lines 2098 2123) no Hoare annotation was computed. [2018-11-10 01:50:42,484 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-10 01:50:42,484 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-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L2074(lines 2074 2097) no Hoare annotation was computed. [2018-11-10 01:50:42,484 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-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-11-10 01:50:42,484 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)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 416) no Hoare annotation was computed. [2018-11-10 01:50:42,484 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)) (< ~IPC~0 (+ ~SKIP2~0 3)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L411-2(lines 399 430) no Hoare annotation was computed. [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 387 431) no Hoare annotation was computed. [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 387 431) no Hoare annotation was computed. [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L423(lines 423 428) no Hoare annotation was computed. [2018-11-10 01:50:42,484 INFO L425 ceAbstractionStarter]: For program point L423-2(lines 423 428) no Hoare annotation was computed. [2018-11-10 01:50:42,485 INFO L421 ceAbstractionStarter]: At program point L2013(lines 2005 2024) the Hoare annotation is: (let ((.cse20 (+ ~myStatus~0 1073741637))) (let ((.cse3 (< 0 .cse20)) (.cse4 (< .cse20 0)) (.cse8 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse6 (not (= ~myStatus~0 0))) (.cse13 (not (= 0 ~pended~0))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= |old(~s~0)| ~NP~0)))) (let ((.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse15 (not (= 1 ~routine~0))) (.cse14 (< ~compRegistered~0 1)) (.cse2 (not (= |old(~customIrp~0)| 0))) (.cse1 (let ((.cse18 (or .cse12 .cse17 (not (= ~compRegistered~0 0)))) (.cse19 (not (= 0 ~routine~0)))) (and (or .cse8 .cse3 .cse11 .cse18 .cse19 .cse9 .cse10 .cse4 .cse13) (or .cse8 .cse18 .cse19 .cse9 .cse10 .cse6 .cse13 .cse11))))) (and (or .cse0 (or .cse1 .cse2)) (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse5 (or .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse12 .cse13 .cse14 .cse15)))) (and (or .cse3 .cse4 .cse5) (or .cse6 .cse5))) .cse2) (or (and (= 1 ~setEventCalled~0) (= ~s~0 |old(~s~0)|) .cse0) (or (let ((.cse16 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse7 .cse3 .cse16 .cse12 .cse11 .cse15 .cse17 .cse9 .cse10 .cse4 .cse13 .cse14) (or .cse7 .cse6 .cse16 .cse12 .cse11 .cse15 .cse17 .cse9 .cse10 .cse13 .cse14))) .cse2)) (or (= |old(~s~0)| ~s~0) .cse1))))) [2018-11-10 01:50:42,485 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 2000 2041) no Hoare annotation was computed. [2018-11-10 01:50:42,485 INFO L425 ceAbstractionStarter]: For program point L2005(lines 2005 2024) no Hoare annotation was computed. [2018-11-10 01:50:42,485 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 2031 2038) no Hoare annotation was computed. [2018-11-10 01:50:42,485 INFO L421 ceAbstractionStarter]: At program point L2030(lines 2029 2039) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse21)) (.cse9 (< .cse21 0)) (.cse16 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse12 (not (= ~myStatus~0 0))) (.cse10 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= |old(~s~0)| ~NP~0)))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse11 (< ~compRegistered~0 1)) (.cse5 (not (= 1 ~routine~0))) (.cse14 (= |old(~customIrp~0)| ~customIrp~0)) (.cse13 (not (= |old(~customIrp~0)| 0))) (.cse17 (= ~s~0 ~NP~0)) (.cse18 (let ((.cse19 (or .cse3 .cse6 (not (= ~compRegistered~0 0)))) (.cse20 (not (= 0 ~routine~0)))) (and (or .cse16 .cse1 .cse4 .cse19 .cse20 .cse7 .cse8 .cse9 .cse10) (or .cse16 .cse19 .cse20 .cse7 .cse8 .cse12 .cse10 .cse4))))) (and (or (or (let ((.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) .cse13) (and .cse14 (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)))) (or (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse15 (or .cse0 .cse16 .cse7 .cse8 .cse4 (or .cse3 .cse10 .cse11 .cse5)))) (and (or .cse1 .cse9 .cse15) (or .cse12 .cse15))) .cse13) (and .cse17 .cse14)) (or .cse14 (or .cse18 .cse13)) (or .cse17 .cse18))))) [2018-11-10 01:50:42,485 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 2031 2038) no Hoare annotation was computed. [2018-11-10 01:50:42,485 INFO L421 ceAbstractionStarter]: At program point L2028(lines 2027 2039) the Hoare annotation is: (let ((.cse21 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse21)) (.cse9 (< .cse21 0)) (.cse16 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse12 (not (= ~myStatus~0 0))) (.cse10 (not (= 0 ~pended~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= |old(~s~0)| ~NP~0)))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse11 (< ~compRegistered~0 1)) (.cse5 (not (= 1 ~routine~0))) (.cse14 (= |old(~customIrp~0)| ~customIrp~0)) (.cse13 (not (= |old(~customIrp~0)| 0))) (.cse17 (= ~s~0 ~NP~0)) (.cse18 (let ((.cse19 (or .cse3 .cse6 (not (= ~compRegistered~0 0)))) (.cse20 (not (= 0 ~routine~0)))) (and (or .cse16 .cse1 .cse4 .cse19 .cse20 .cse7 .cse8 .cse9 .cse10) (or .cse16 .cse19 .cse20 .cse7 .cse8 .cse12 .cse10 .cse4))))) (and (or (or (let ((.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) .cse13) (and .cse14 (and (= |old(~s~0)| ~s~0) (= 1 ~setEventCalled~0)))) (or (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse15 (or .cse0 .cse16 .cse7 .cse8 .cse4 (or .cse3 .cse10 .cse11 .cse5)))) (and (or .cse1 .cse9 .cse15) (or .cse12 .cse15))) .cse13) (and .cse17 .cse14)) (or .cse14 (or .cse18 .cse13)) (or .cse17 .cse18))))) [2018-11-10 01:50:42,486 INFO L421 ceAbstractionStarter]: At program point L2020(line 2020) the Hoare annotation is: (let ((.cse11 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse5 (not (= ~myStatus~0 0))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse15 (< ~compRegistered~0 1)) (.cse12 (not (= 1 ~routine~0))) (.cse16 (not (= |old(~customIrp~0)| 0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< 0 .cse18)) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (or .cse11 .cse13 (not (= ~compRegistered~0 0)))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse14 (< .cse18 0)) (.cse6 (not (= 0 ~pended~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (let ((.cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse8 .cse9 .cse10 .cse11 .cse7 .cse12 .cse13 .cse3 .cse4 .cse14 .cse6 .cse15) (or .cse8 .cse5 .cse10 .cse11 .cse7 .cse12 .cse13 .cse3 .cse4 .cse6 .cse15))) .cse16) (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse17 (or .cse8 .cse0 .cse3 .cse4 .cse7 (or .cse11 .cse6 .cse15 .cse12)))) (and (or .cse9 .cse14 .cse17) (or .cse5 .cse17))) .cse16) (or .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6)))) [2018-11-10 01:50:42,486 INFO L425 ceAbstractionStarter]: For program point L2018(lines 2018 2022) no Hoare annotation was computed. [2018-11-10 01:50:42,486 INFO L425 ceAbstractionStarter]: For program point L2018-1(lines 2005 2024) no Hoare annotation was computed. [2018-11-10 01:50:42,486 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 2000 2041) no Hoare annotation was computed. [2018-11-10 01:50:42,486 INFO L425 ceAbstractionStarter]: For program point L2006(lines 2006 2011) no Hoare annotation was computed. [2018-11-10 01:50:42,486 INFO L425 ceAbstractionStarter]: For program point L2027(lines 2027 2039) no Hoare annotation was computed. [2018-11-10 01:50:42,486 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 2000 2041) the Hoare annotation is: (let ((.cse22 (+ ~myStatus~0 1073741637))) (let ((.cse3 (< 0 .cse22)) (.cse11 (< .cse22 0)) (.cse18 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse14 (not (= ~myStatus~0 0))) (.cse12 (not (= 0 ~pended~0))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= |old(~s~0)| ~s~0)) (.cse19 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse13 (< ~compRegistered~0 1)) (.cse7 (not (= 1 ~routine~0))) (.cse16 (and (and .cse1 (= 1 ~setEventCalled~0)) .cse19)) (.cse0 (let ((.cse20 (or .cse5 .cse8 (not (= ~compRegistered~0 0)))) (.cse21 (not (= 0 ~routine~0)))) (and (or .cse18 .cse3 .cse6 .cse20 .cse21 .cse9 .cse10 .cse11 .cse12) (or .cse18 .cse20 .cse21 .cse9 .cse10 .cse14 .cse12 .cse6)))) (.cse15 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1) (or (or (let ((.cse4 (< ~SKIP1~0 (+ |old(~s~0)| 2)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13))) .cse15) .cse16) (or (or (not (= |old(~s~0)| ~MPR3~0)) (let ((.cse17 (or .cse2 .cse18 .cse9 .cse10 .cse6 (or .cse5 .cse12 .cse13 .cse7)))) (and (or .cse3 .cse11 .cse17) (or .cse14 .cse17))) .cse15) .cse16) (or (or .cse0 .cse15) .cse19))))) [2018-11-10 01:50:42,487 INFO L421 ceAbstractionStarter]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse3 (< ~SKIP2~0 .cse13)) (.cse4 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse12 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse13 ~SKIP2~0) (= |old(~s~0)| ~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)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-10 01:50:42,487 INFO L425 ceAbstractionStarter]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2018-11-10 01:50:42,487 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~routine~0 0))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse7 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse8 .cse9)))) [2018-11-10 01:50:42,487 INFO L425 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2018-11-10 01:50:42,487 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))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,487 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 (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-10 01:50:42,487 INFO L425 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 1589 1637) no Hoare annotation was computed. [2018-11-10 01:50:42,487 INFO L425 ceAbstractionStarter]: For program point L1614(lines 1614 1621) no Hoare annotation was computed. [2018-11-10 01:50:42,487 INFO L425 ceAbstractionStarter]: For program point L1614-1(lines 1609 1622) no Hoare annotation was computed. [2018-11-10 01:50:42,488 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 (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-10 01:50:42,488 INFO L425 ceAbstractionStarter]: For program point L1609(lines 1609 1622) no Hoare annotation was computed. [2018-11-10 01:50:42,488 INFO L425 ceAbstractionStarter]: For program point L1608(lines 1608 1633) no Hoare annotation was computed. [2018-11-10 01:50:42,488 INFO L425 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 1589 1637) no Hoare annotation was computed. [2018-11-10 01:50:42,488 INFO L425 ceAbstractionStarter]: For program point L1986-1(lines 1978 1991) no Hoare annotation was computed. [2018-11-10 01:50:42,488 INFO L425 ceAbstractionStarter]: For program point L1982(lines 1982 1988) no Hoare annotation was computed. [2018-11-10 01:50:42,488 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1978 1991) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~SKIP2~0 3)) .cse5) (= ~s~0 |old(~s~0)|)) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (= |old(~s~0)| ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-11-10 01:50:42,488 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1978 1991) no Hoare annotation was computed. [2018-11-10 01:50:42,488 INFO L421 ceAbstractionStarter]: At program point L1986(line 1986) the Hoare annotation is: (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (not (= |old(~s~0)| ~NP~0)))) (and (or (or (or .cse0 .cse1) .cse2 .cse3 .cse4 (< ~compRegistered~0 1) (not (= 1 ~routine~0))) (< ~IPC~0 (+ ~SKIP2~0 3)) .cse5) (or .cse2 .cse0 (not (= 0 ~routine~0)) .cse3 .cse4 .cse5 (< ~IPC~0 (+ ~DC~0 5)) (or .cse1 (not (= ~compRegistered~0 0)))))) [2018-11-10 01:50:42,489 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-10 01:50:42,489 INFO L425 ceAbstractionStarter]: For program point L1697-1(line 1697) no Hoare annotation was computed. [2018-11-10 01:50:42,489 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-10 01:50:42,489 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-10 01:50:42,489 INFO L425 ceAbstractionStarter]: For program point L1691-1(lines 1687 1693) no Hoare annotation was computed. [2018-11-10 01:50:42,489 INFO L425 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 1680 1701) no Hoare annotation was computed. [2018-11-10 01:50:42,489 INFO L425 ceAbstractionStarter]: For program point L1687(lines 1687 1693) no Hoare annotation was computed. [2018-11-10 01:50:42,489 INFO L425 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 1680 1701) no Hoare annotation was computed. [2018-11-10 01:50:42,489 INFO L425 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 1567 1588) no Hoare annotation was computed. [2018-11-10 01:50:42,489 INFO L421 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 1567 1588) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< ~SKIP1~0 (+ ~s~0 2))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (= 0 ~pended~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse10) .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse8 .cse9)))) [2018-11-10 01:50:42,490 INFO L425 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 1567 1588) no Hoare annotation was computed. [2018-11-10 01:50:42,490 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 (= 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)|)) (< ~compRegistered~0 1))) [2018-11-10 01:50:42,490 INFO L425 ceAbstractionStarter]: For program point L1581(lines 1581 1585) no Hoare annotation was computed. [2018-11-10 01:50:42,490 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 (= 0 ~routine~0))) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (< ~compRegistered~0 1))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~myStatus~0 1073741637))) (or .cse0 (< 0 .cse9) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-10 01:50:42,490 INFO L425 ceAbstractionStarter]: For program point L1573(lines 1573 1579) no Hoare annotation was computed. [2018-11-10 01:50:42,490 INFO L425 ceAbstractionStarter]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2018-11-10 01:50:42,490 INFO L425 ceAbstractionStarter]: For program point L1572-1(lines 1571 1587) no Hoare annotation was computed. [2018-11-10 01:50:42,490 INFO L428 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 1557 1566) the Hoare annotation is: true [2018-11-10 01:50:42,490 INFO L425 ceAbstractionStarter]: For program point L1561(lines 1561 1563) no Hoare annotation was computed. [2018-11-10 01:50:42,490 INFO L425 ceAbstractionStarter]: For program point L1561-2(lines 1557 1566) no Hoare annotation was computed. [2018-11-10 01:50:42,490 INFO L425 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 1557 1566) no Hoare annotation was computed. [2018-11-10 01:50:42,490 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1992 1999) the Hoare annotation is: true [2018-11-10 01:50:42,491 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1992 1999) no Hoare annotation was computed. [2018-11-10 01:50:42,491 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1992 1999) no Hoare annotation was computed. [2018-11-10 01:50:42,491 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 1702 1715) no Hoare annotation was computed. [2018-11-10 01:50:42,491 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 1702 1715) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ ~myStatus~0 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0)) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-10 01:50:42,491 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 1702 1715) no Hoare annotation was computed. [2018-11-10 01:50:42,491 INFO L428 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 130 139) the Hoare annotation is: true [2018-11-10 01:50:42,491 INFO L425 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 130 139) no Hoare annotation was computed. [2018-11-10 01:50:42,491 INFO L428 ceAbstractionStarter]: At program point L135(line 135) the Hoare annotation is: true [2018-11-10 01:50:42,491 INFO L425 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-11-10 01:50:42,491 INFO L425 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 130 139) no Hoare annotation was computed. [2018-11-10 01:50:42,493 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 290) no Hoare annotation was computed. [2018-11-10 01:50:42,493 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,493 INFO L425 ceAbstractionStarter]: For program point L254-1(line 254) no Hoare annotation was computed. [2018-11-10 01:50:42,494 INFO L421 ceAbstractionStarter]: At program point L287-2(lines 277 291) the Hoare annotation is: (or (and (and (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0)))) [2018-11-10 01:50:42,494 INFO L425 ceAbstractionStarter]: For program point L275(line 275) no Hoare annotation was computed. [2018-11-10 01:50:42,494 INFO L425 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-10 01:50:42,494 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 306) no Hoare annotation was computed. [2018-11-10 01:50:42,494 INFO L425 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-11-10 01:50:42,494 INFO L425 ceAbstractionStarter]: For program point L263(lines 263 273) no Hoare annotation was computed. [2018-11-10 01:50:42,494 INFO L421 ceAbstractionStarter]: At program point L259(lines 259 260) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-10 01:50:42,494 INFO L425 ceAbstractionStarter]: For program point L259-1(lines 259 260) no Hoare annotation was computed. [2018-11-10 01:50:42,494 INFO L425 ceAbstractionStarter]: For program point $Ultimate##6(lines 242 305) no Hoare annotation was computed. [2018-11-10 01:50:42,494 INFO L425 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 217 310) no Hoare annotation was computed. [2018-11-10 01:50:42,499 INFO L421 ceAbstractionStarter]: At program point L239(lines 238 306) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-10 01:50:42,500 INFO L421 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 217 310) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-10 01:50:42,500 INFO L421 ceAbstractionStarter]: At program point L268(lines 263 273) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (<= CdAudioPnp_~setPagable~0 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-10 01:50:42,500 INFO L425 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 217 310) no Hoare annotation was computed. [2018-11-10 01:50:42,500 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 307) no Hoare annotation was computed. [2018-11-10 01:50:42,500 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-10 01:50:42,500 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-10 01:50:42,500 INFO L421 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (<= (+ |old(~myStatus~0)| 1) 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (= ~routine~0 1)) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~myStatus~0)| CdAudioPnp_~status~2))) [2018-11-10 01:50:42,508 INFO L425 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2018-11-10 01:50:42,508 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 291) no Hoare annotation was computed. [2018-11-10 01:50:42,508 INFO L421 ceAbstractionStarter]: At program point L236(lines 235 307) the Hoare annotation is: (or (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (<= (+ ~myStatus~0 1073741637) 0))) [2018-11-10 01:50:42,508 INFO L421 ceAbstractionStarter]: At program point L269-1(lines 263 273) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0)))) [2018-11-10 01:50:42,508 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) (= ~myStatus~0 |old(~myStatus~0)|)) (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| CdAudioPnp_~status~2)) (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0)))) [2018-11-10 01:50:42,508 INFO L425 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-10 01:50:42,508 INFO L425 ceAbstractionStarter]: For program point $Ultimate##5(lines 242 305) no Hoare annotation was computed. [2018-11-10 01:50:42,511 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-10 01:50:42,511 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 280) no Hoare annotation was computed. [2018-11-10 01:50:42,512 INFO L425 ceAbstractionStarter]: For program point L245(line 245) no Hoare annotation was computed. [2018-11-10 01:50:42,512 INFO L425 ceAbstractionStarter]: For program point L278-2(lines 277 286) no Hoare annotation was computed. [2018-11-10 01:50:42,512 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,512 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 54 61) the Hoare annotation is: true [2018-11-10 01:50:42,512 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 54 61) no Hoare annotation was computed. [2018-11-10 01:50:42,512 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 58) no Hoare annotation was computed. [2018-11-10 01:50:42,512 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 54 61) no Hoare annotation was computed. [2018-11-10 01:50:42,512 INFO L421 ceAbstractionStarter]: At program point L828(line 828) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,512 INFO L425 ceAbstractionStarter]: For program point L828-1(line 828) no Hoare annotation was computed. [2018-11-10 01:50:42,512 INFO L421 ceAbstractionStarter]: At program point L663(lines 663 664) the Hoare annotation is: (let ((.cse14 (+ ~SKIP2~0 3)) (.cse13 (+ ~SKIP1~0 2)) (.cse15 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse3 (< ~SKIP2~0 .cse15)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse13)) (.cse7 (< ~IPC~0 .cse14)) (.cse8 (and (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse12 ~MPR3~0) (= ~s~0 ~NP~0) (<= .cse13 ~MPR1~0)) (<= .cse14 ~IPC~0) (<= .cse15 ~SKIP2~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-10 01:50:42,512 INFO L425 ceAbstractionStarter]: For program point L663-1(lines 663 664) no Hoare annotation was computed. [2018-11-10 01:50:42,519 INFO L421 ceAbstractionStarter]: At program point L597(lines 596 858) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,519 INFO L425 ceAbstractionStarter]: For program point L614(lines 614 854) no Hoare annotation was computed. [2018-11-10 01:50:42,519 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-11-10 01:50:42,519 INFO L425 ceAbstractionStarter]: For program point L714(lines 714 718) no Hoare annotation was computed. [2018-11-10 01:50:42,519 INFO L421 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,519 INFO L421 ceAbstractionStarter]: At program point L764(line 764) the Hoare annotation is: (let ((.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741823) 0) (<= .cse12 ~MPR3~0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-10 01:50:42,519 INFO L425 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-11-10 01:50:42,519 INFO L425 ceAbstractionStarter]: For program point L764-1(line 764) no Hoare annotation was computed. [2018-11-10 01:50:42,519 INFO L425 ceAbstractionStarter]: For program point L698(lines 698 705) no Hoare annotation was computed. [2018-11-10 01:50:42,520 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 850) no Hoare annotation was computed. [2018-11-10 01:50:42,520 INFO L421 ceAbstractionStarter]: At program point L633(lines 632 850) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,523 INFO L421 ceAbstractionStarter]: At program point L848(lines 636 849) the Hoare annotation is: (let ((.cse11 (+ ~SKIP2~0 3)) (.cse15 (+ ~SKIP1~0 2)) (.cse12 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 5)) (.cse13 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse13)) (.cse1 (< ~MPR3~0 .cse14)) (.cse3 (< ~SKIP2~0 .cse12)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse15)) (.cse7 (< ~IPC~0 .cse11)) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (and (<= .cse11 ~IPC~0) (<= .cse12 ~SKIP2~0) (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (and (<= .cse13 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse14 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse15 ~MPR1~0))))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9 .cse10)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-10 01:50:42,524 INFO L421 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,524 INFO L425 ceAbstractionStarter]: For program point L815-1(line 815) no Hoare annotation was computed. [2018-11-10 01:50:42,524 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 803) no Hoare annotation was computed. [2018-11-10 01:50:42,524 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 675) no Hoare annotation was computed. [2018-11-10 01:50:42,524 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 786) no Hoare annotation was computed. [2018-11-10 01:50:42,524 INFO L421 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 432 875) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9)))) [2018-11-10 01:50:42,524 INFO L425 ceAbstractionStarter]: For program point L651(lines 651 658) no Hoare annotation was computed. [2018-11-10 01:50:42,534 INFO L425 ceAbstractionStarter]: For program point L800(lines 800 802) no Hoare annotation was computed. [2018-11-10 01:50:42,534 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 864) no Hoare annotation was computed. [2018-11-10 01:50:42,535 INFO L425 ceAbstractionStarter]: For program point L553(lines 553 868) no Hoare annotation was computed. [2018-11-10 01:50:42,535 INFO L421 ceAbstractionStarter]: At program point L702(line 702) the Hoare annotation is: (let ((.cse15 (+ ~SKIP1~0 2)) (.cse12 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 5)) (.cse13 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse13)) (.cse1 (< ~MPR3~0 .cse14)) (.cse2 (< ~SKIP2~0 .cse12)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 .cse15)) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse9 (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (<= .cse12 ~SKIP2~0) (<= .cse11 0) (and (<= .cse13 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse14 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse15 ~MPR1~0))))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse10 0) .cse7 .cse9 .cse8))))) [2018-11-10 01:50:42,535 INFO L425 ceAbstractionStarter]: For program point L702-1(line 702) no Hoare annotation was computed. [2018-11-10 01:50:42,535 INFO L421 ceAbstractionStarter]: At program point L570(lines 569 864) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,535 INFO L425 ceAbstractionStarter]: For program point L818(lines 818 820) no Hoare annotation was computed. [2018-11-10 01:50:42,535 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 759) no Hoare annotation was computed. [2018-11-10 01:50:42,535 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 860) no Hoare annotation was computed. [2018-11-10 01:50:42,535 INFO L421 ceAbstractionStarter]: At program point L554(lines 553 868) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,535 INFO L425 ceAbstractionStarter]: For program point L736(lines 736 740) no Hoare annotation was computed. [2018-11-10 01:50:42,535 INFO L421 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: (let ((.cse11 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 5)) (.cse13 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse13)) (.cse1 (< ~MPR3~0 .cse14)) (.cse3 (let ((.cse12 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse12) (<= .cse11 ~SKIP2~0) (<= .cse12 0) (and (<= .cse13 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse14 ~MPR3~0))))) (.cse2 (< ~SKIP2~0 .cse11)) (.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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,543 INFO L425 ceAbstractionStarter]: For program point L736-2(lines 636 847) no Hoare annotation was computed. [2018-11-10 01:50:42,543 INFO L425 ceAbstractionStarter]: For program point L670-1(line 670) no Hoare annotation was computed. [2018-11-10 01:50:42,543 INFO L421 ceAbstractionStarter]: At program point L588(lines 587 860) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,543 INFO L425 ceAbstractionStarter]: For program point L605(lines 605 856) no Hoare annotation was computed. [2018-11-10 01:50:42,543 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 793) no Hoare annotation was computed. [2018-11-10 01:50:42,543 INFO L425 ceAbstractionStarter]: For program point L787-1(lines 787 793) no Hoare annotation was computed. [2018-11-10 01:50:42,544 INFO L421 ceAbstractionStarter]: At program point L721(lines 711 732) the Hoare annotation is: (let ((.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (= ~myStatus~0 |old(~myStatus~0)|) (<= .cse11 0) (and (<= .cse12 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse13 ~MPR3~0))))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-10 01:50:42,544 INFO L421 ceAbstractionStarter]: At program point L655(line 655) the Hoare annotation is: (let ((.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse3 (and (<= (+ CdAudio535DeviceControl_~status~5 1073741670) 0) (and (<= .cse11 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse12 ~MPR3~0)))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse2 0) .cse9 .cse10)) (or .cse0 .cse1 .cse3 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-10 01:50:42,555 INFO L425 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 432 875) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point L655-1(line 655) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L421 ceAbstractionStarter]: At program point L771(lines 771 772) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point L771-1(lines 771 772) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point L623(lines 623 852) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 636 849) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point $Ultimate##22(lines 636 849) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 791) no Hoare annotation was computed. [2018-11-10 01:50:42,556 INFO L421 ceAbstractionStarter]: At program point L756(line 756) the Hoare annotation is: (let ((.cse12 (+ ~NP~0 2)) (.cse11 (+ ~NP~0 5))) (let ((.cse2 (let ((.cse13 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse13) (<= .cse11 ~MPR3~0) (<= .cse13 0)))) (.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse11)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse0 .cse1 (< 0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,556 INFO L425 ceAbstractionStarter]: For program point L756-1(line 756) no Hoare annotation was computed. [2018-11-10 01:50:42,564 INFO L421 ceAbstractionStarter]: At program point L624(lines 605 856) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~0) (= |old(~s~0)| ~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,564 INFO L425 ceAbstractionStarter]: For program point L839(line 839) no Hoare annotation was computed. [2018-11-10 01:50:42,564 INFO L425 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2018-11-10 01:50:42,564 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 730) no Hoare annotation was computed. [2018-11-10 01:50:42,564 INFO L421 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9)))) [2018-11-10 01:50:42,564 INFO L425 ceAbstractionStarter]: For program point L691-1(line 691) no Hoare annotation was computed. [2018-11-10 01:50:42,564 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 778) no Hoare annotation was computed. [2018-11-10 01:50:42,564 INFO L425 ceAbstractionStarter]: For program point L560(lines 560 866) no Hoare annotation was computed. [2018-11-10 01:50:42,564 INFO L421 ceAbstractionStarter]: At program point L841(lines 634 850) the Hoare annotation is: (let ((.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (and (<= .cse11 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse12 ~MPR3~0))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,564 INFO L425 ceAbstractionStarter]: For program point L808(lines 808 811) no Hoare annotation was computed. [2018-11-10 01:50:42,565 INFO L421 ceAbstractionStarter]: At program point L709(line 709) the Hoare annotation is: (let ((.cse13 (+ ~SKIP1~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse13)) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse12 ~MPR3~0) (= ~s~0 ~NP~0) (<= .cse13 ~MPR1~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 (and .cse3 (= 0 ~myStatus~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse4 .cse5 .cse6 .cse7 (and .cse3 (= ~myStatus~0 |old(~myStatus~0)|)) (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,570 INFO L425 ceAbstractionStarter]: For program point L709-1(line 709) no Hoare annotation was computed. [2018-11-10 01:50:42,570 INFO L425 ceAbstractionStarter]: For program point L693(lines 693 697) no Hoare annotation was computed. [2018-11-10 01:50:42,570 INFO L421 ceAbstractionStarter]: At program point L561(lines 560 866) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= ~myStatus~0 |old(~myStatus~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9)))) [2018-11-10 01:50:42,570 INFO L425 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 432 875) no Hoare annotation was computed. [2018-11-10 01:50:42,570 INFO L425 ceAbstractionStarter]: For program point L578(lines 578 862) no Hoare annotation was computed. [2018-11-10 01:50:42,570 INFO L425 ceAbstractionStarter]: For program point L760(lines 760 767) no Hoare annotation was computed. [2018-11-10 01:50:42,571 INFO L421 ceAbstractionStarter]: At program point L727(line 727) the Hoare annotation is: (let ((.cse13 (+ ~NP~0 5)) (.cse12 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse13)) (.cse2 (let ((.cse11 (+ CdAudio535DeviceControl_~status~5 1073741670))) (and (<= 0 .cse11) (= ~myStatus~0 |old(~myStatus~0)|) (<= .cse11 0) (and (<= .cse12 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (<= .cse13 ~MPR3~0))))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-10 01:50:42,571 INFO L425 ceAbstractionStarter]: For program point L727-1(line 727) no Hoare annotation was computed. [2018-11-10 01:50:42,571 INFO L425 ceAbstractionStarter]: For program point L843(line 843) no Hoare annotation was computed. [2018-11-10 01:50:42,571 INFO L425 ceAbstractionStarter]: For program point L711(lines 711 732) no Hoare annotation was computed. [2018-11-10 01:50:42,571 INFO L425 ceAbstractionStarter]: For program point L678(lines 678 680) no Hoare annotation was computed. [2018-11-10 01:50:42,571 INFO L425 ceAbstractionStarter]: For program point L711-1(lines 711 732) no Hoare annotation was computed. [2018-11-10 01:50:42,571 INFO L421 ceAbstractionStarter]: At program point L579(lines 578 862) the Hoare annotation is: (let ((.cse13 (+ ~DC~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~NP~0 2))) (let ((.cse0 (< ~SKIP1~0 .cse11)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (< ~SKIP2~0 .cse13)) (.cse3 (and (<= .cse11 ~SKIP1~0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse12 ~MPR3~0) (<= .cse13 ~SKIP2~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)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 0) .cse8 .cse9))))) [2018-11-10 01:50:42,577 INFO L425 ceAbstractionStarter]: For program point L596(lines 596 858) no Hoare annotation was computed. [2018-11-10 01:50:42,577 INFO L425 ceAbstractionStarter]: For program point L646(lines 646 650) no Hoare annotation was computed. [2018-11-10 01:50:42,577 INFO L421 ceAbstractionStarter]: At program point L1947(lines 1900 1976) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse19 0) (= 1 ~setEventCalled~0) (<= 0 .cse19))) (or (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0)))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-10 01:50:42,578 INFO L421 ceAbstractionStarter]: At program point L1935(lines 1934 1949) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse19 0) (= 1 ~setEventCalled~0) (<= 0 .cse19))) (or (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0)))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-10 01:50:42,580 INFO L425 ceAbstractionStarter]: For program point L1902(lines 1902 1912) no Hoare annotation was computed. [2018-11-10 01:50:42,581 INFO L425 ceAbstractionStarter]: For program point L1927(lines 1927 1950) no Hoare annotation was computed. [2018-11-10 01:50:42,581 INFO L425 ceAbstractionStarter]: For program point L1956(lines 1956 1973) no Hoare annotation was computed. [2018-11-10 01:50:42,581 INFO L425 ceAbstractionStarter]: For program point L1915(lines 1915 1919) no Hoare annotation was computed. [2018-11-10 01:50:42,581 INFO L425 ceAbstractionStarter]: For program point L1907(lines 1907 1911) no Hoare annotation was computed. [2018-11-10 01:50:42,581 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 1893 1977) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse19 (+ ~myStatus~0 1073741637))) (let ((.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse12 (< 0 .cse19)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse16 (and .cse0 (= |old(~s~0)| ~s~0))) (.cse6 (not (= 0 ~routine~0))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse19 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse6 .cse15 .cse7 .cse8 .cse16 .cse11 .cse17) (or (and .cse0 (= ~s~0 |old(~s~0)|)) (let ((.cse18 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse18 .cse15 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse18 .cse15 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0))) (or .cse2 .cse12 .cse14 .cse4 .cse16 .cse6 .cse15 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-10 01:50:42,581 INFO L425 ceAbstractionStarter]: For program point L1907-2(lines 1902 1912) no Hoare annotation was computed. [2018-11-10 01:50:42,581 INFO L425 ceAbstractionStarter]: For program point L1965(lines 1965 1972) no Hoare annotation was computed. [2018-11-10 01:50:42,581 INFO L425 ceAbstractionStarter]: For program point L1932(lines 1932 1949) no Hoare annotation was computed. [2018-11-10 01:50:42,590 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 1936 1948) no Hoare annotation was computed. [2018-11-10 01:50:42,590 INFO L421 ceAbstractionStarter]: At program point L1928(lines 1927 1950) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse19 0) (= 1 ~setEventCalled~0) (<= 0 .cse19))) (or (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0)))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-10 01:50:42,590 INFO L425 ceAbstractionStarter]: For program point $Ultimate##20(lines 1936 1948) no Hoare annotation was computed. [2018-11-10 01:50:42,590 INFO L425 ceAbstractionStarter]: For program point L1957(lines 1957 1963) no Hoare annotation was computed. [2018-11-10 01:50:42,590 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 1893 1977) no Hoare annotation was computed. [2018-11-10 01:50:42,591 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 1893 1977) no Hoare annotation was computed. [2018-11-10 01:50:42,591 INFO L421 ceAbstractionStarter]: At program point L1970(line 1970) the Hoare annotation is: (let ((.cse17 (+ ~myStatus~0 1073741637))) (let ((.cse10 (< 0 .cse17)) (.cse11 (< .cse17 0)) (.cse13 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse14 (< ~SKIP1~0 |old(~s~0)|)) (.cse15 (< |old(~s~0)| ~SKIP1~0)) (.cse16 (not (= ~compRegistered~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (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 (= 0 |old(~pended~0)|))) (.cse9 (< ~compRegistered~0 1))) (and (or (let ((.cse4 (not (= 1 ~routine~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9))) (not (= ~customIrp~0 0))) (or .cse0 .cse10 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9) (or .cse13 .cse0 .cse10 .cse3 .cse14 .cse12 .cse6 .cse7 .cse11 .cse15 .cse16 .cse8) (or .cse13 .cse0 .cse1 .cse3 .cse14 .cse12 .cse6 .cse7 .cse15 .cse16 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,591 INFO L425 ceAbstractionStarter]: For program point L1970-1(lines 1952 1974) no Hoare annotation was computed. [2018-11-10 01:50:42,591 INFO L421 ceAbstractionStarter]: At program point L1904(line 1904) the Hoare annotation is: (let ((.cse18 (+ ~myStatus~0 1073741637))) (let ((.cse10 (< 0 .cse18)) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse13 (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< .cse18 0)) (.cse9 (< ~compRegistered~0 1)) (.cse14 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (< ~SKIP1~0 |old(~s~0)|)) (.cse12 (not (= 0 ~routine~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse16 (< |old(~s~0)| ~SKIP1~0)) (.cse17 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or (let ((.cse4 (not (= 1 ~routine~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9))) (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9) (or .cse14 .cse0 .cse10 .cse3 .cse15 .cse12 .cse6 .cse7 .cse11 .cse16 .cse17 .cse8) (or .cse0 .cse10 .cse2 .cse3 .cse13 .cse12 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9) (or .cse14 .cse0 .cse1 .cse3 .cse15 .cse12 .cse6 .cse7 .cse16 .cse17 .cse8)))) [2018-11-10 01:50:42,601 INFO L425 ceAbstractionStarter]: For program point L1904-1(line 1904) no Hoare annotation was computed. [2018-11-10 01:50:42,601 INFO L421 ceAbstractionStarter]: At program point L1933(lines 1932 1949) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2)) (.cse21 (+ ~myStatus~0 1073741637)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (< ~MPR3~0 .cse22)) (.cse12 (< 0 .cse21)) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse4 (< ~SKIP2~0 .cse23)) (.cse15 (and (<= .cse22 ~MPR3~0) (<= .cse23 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse6 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (< .cse21 0)) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse17 (< ~compRegistered~0 1))) (and (or (and .cse0 (= ~s~0 ~SKIP1~0)) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~SKIP1~0 |old(~s~0)|)) (.cse9 (< |old(~s~0)| ~SKIP1~0)) (.cse10 (not (= ~compRegistered~0 0)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)))) (or .cse2 .cse3 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse11 .cse17) (or (let ((.cse18 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse19 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse18 0) .cse0 (<= 0 .cse18) (= ~MPR1~0 ~s~0) (<= .cse19 0) (= 1 ~setEventCalled~0) (<= 0 .cse19))) (or (let ((.cse20 (not (= 1 ~routine~0)))) (and (or .cse2 .cse3 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse11 .cse17) (or .cse2 .cse12 .cse14 .cse4 .cse20 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17))) (not (= ~customIrp~0 0)))) (or .cse2 .cse12 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse13 .cse11 .cse17)))) [2018-11-10 01:50:42,602 INFO L421 ceAbstractionStarter]: At program point L1917(line 1917) the Hoare annotation is: (let ((.cse19 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse19)) (.cse8 (< .cse19 0)) (.cse15 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse16 (< ~SKIP1~0 |old(~s~0)|)) (.cse17 (< |old(~s~0)| ~SKIP1~0)) (.cse18 (not (= ~compRegistered~0 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 (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (let ((.cse11 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse12 (+ IofCallDriver_~__cil_tmp8~1 1073741802))) (and (<= .cse11 0) (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= 0 .cse11) (<= .cse12 0) (= 1 ~setEventCalled~0) (<= 0 .cse12))) (or (let ((.cse14 (not (= 1 ~routine~0)))) (and (or .cse0 .cse13 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= ~customIrp~0 0)))) (or .cse15 .cse0 .cse1 .cse3 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse18 .cse9) (or .cse15 .cse0 .cse13 .cse3 .cse16 .cse4 .cse6 .cse7 .cse17 .cse18 .cse9) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2018-11-10 01:50:42,614 INFO L421 ceAbstractionStarter]: At program point L1909(line 1909) the Hoare annotation is: (let ((.cse17 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse17)) (.cse8 (< .cse17 0)) (.cse11 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse12 (< ~SKIP1~0 |old(~s~0)|)) (.cse13 (< |old(~s~0)| ~SKIP1~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (not (= ~myStatus~0 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (< ~compRegistered~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9) (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (let ((.cse16 (not (= 1 ~routine~0)))) (and (or .cse0 .cse15 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (not (= ~customIrp~0 0))) (or .cse11 .cse0 .cse15 .cse3 .cse12 .cse4 .cse6 .cse7 .cse13 .cse14 .cse9) (or .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2018-11-10 01:50:42,614 INFO L425 ceAbstractionStarter]: For program point L1909-1(line 1909) no Hoare annotation was computed. [2018-11-10 01:50:42,614 INFO L425 ceAbstractionStarter]: For program point L1901(lines 1901 1921) no Hoare annotation was computed. [2018-11-10 01:50:42,614 INFO L425 ceAbstractionStarter]: For program point L1901-1(lines 1900 1976) no Hoare annotation was computed. [2018-11-10 01:50:42,614 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-10 01:50:42,614 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-10 01:50:42,614 INFO L425 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-10 01:50:42,623 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-10 01:50:42,623 INFO L425 ceAbstractionStarter]: For program point L376-1(lines 372 378) no Hoare annotation was computed. [2018-11-10 01:50:42,623 INFO L425 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 365 386) no Hoare annotation was computed. [2018-11-10 01:50:42,623 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 378) no Hoare annotation was computed. [2018-11-10 01:50:42,623 INFO L425 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 365 386) no Hoare annotation was computed. [2018-11-10 01:50:42,623 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 01:50:42,623 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-10 01:50:42,623 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 01:50:42,624 INFO L421 ceAbstractionStarter]: At program point L1537(line 1537) the Hoare annotation is: (or (and (<= (+ CdAudioAtapiDeviceControl_~status~7 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (< ~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)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-10 01:50:42,624 INFO L425 ceAbstractionStarter]: For program point L1537-1(line 1537) no Hoare annotation was computed. [2018-11-10 01:50:42,624 INFO L425 ceAbstractionStarter]: For program point L1533(lines 1533 1540) no Hoare annotation was computed. [2018-11-10 01:50:42,624 INFO L421 ceAbstractionStarter]: At program point L1530(line 1530) 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)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,624 INFO L425 ceAbstractionStarter]: For program point L1530-1(line 1530) no Hoare annotation was computed. [2018-11-10 01:50:42,624 INFO L425 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 1499 1556) no Hoare annotation was computed. [2018-11-10 01:50:42,624 INFO L425 ceAbstractionStarter]: For program point L1524(lines 1524 1547) no Hoare annotation was computed. [2018-11-10 01:50:42,624 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)) (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)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,624 INFO L425 ceAbstractionStarter]: For program point L1524-1(lines 1524 1547) no Hoare annotation was computed. [2018-11-10 01:50:42,624 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)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-10 01:50:42,630 INFO L425 ceAbstractionStarter]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2018-11-10 01:50:42,630 INFO L421 ceAbstractionStarter]: At program point L1544(line 1544) 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)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,630 INFO L425 ceAbstractionStarter]: For program point L1544-1(line 1544) no Hoare annotation was computed. [2018-11-10 01:50:42,630 INFO L425 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 1499 1556) no Hoare annotation was computed. [2018-11-10 01:50:42,630 INFO L421 ceAbstractionStarter]: At program point L353(line 353) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,631 INFO L421 ceAbstractionStarter]: At program point L320(lines 319 360) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,631 INFO L425 ceAbstractionStarter]: For program point L353-1(line 353) no Hoare annotation was computed. [2018-11-10 01:50:42,631 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 361) no Hoare annotation was computed. [2018-11-10 01:50:42,631 INFO L425 ceAbstractionStarter]: For program point L347(line 347) no Hoare annotation was computed. [2018-11-10 01:50:42,631 INFO L425 ceAbstractionStarter]: For program point L337(line 337) no Hoare annotation was computed. [2018-11-10 01:50:42,631 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 329 357) no Hoare annotation was computed. [2018-11-10 01:50:42,631 INFO L425 ceAbstractionStarter]: For program point L325(lines 325 358) no Hoare annotation was computed. [2018-11-10 01:50:42,631 INFO L421 ceAbstractionStarter]: At program point L356(lines 329 357) the Hoare annotation is: (let ((.cse14 (+ ~NP~0 5))) (let ((.cse3 (and (= 0 ~pended~0) (<= .cse14 ~MPR3~0))) (.cse0 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (.cse1 (= ~routine~0 0)) (.cse2 (= ~IPC~0 ~s~0))) (or (and .cse0 .cse1 (<= 1 ~compRegistered~0) .cse2) (and (<= CdAudioDeviceControl_~status~3 ~lowerDriverReturn~0) (and .cse3 .cse1 (= ~SKIP2~0 ~s~0)) (<= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~3)) (and (not (= 259 CdAudioDeviceControl_~status~3)) (= ~DC~0 ~s~0) (and .cse3 .cse1)) (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse5 (< ~MPR3~0 .cse14)) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (not (= 0 |old(~routine~0)|))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse6 (+ |old(~myStatus~0)| 1073741637))) (or .cse4 .cse5 (< 0 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse6 0) .cse12 .cse13)) (or .cse4 .cse5 (not (= |old(~myStatus~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) (and .cse3 .cse0 .cse1 .cse2)))) [2018-11-10 01:50:42,635 INFO L421 ceAbstractionStarter]: At program point L323(lines 322 359) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,636 INFO L425 ceAbstractionStarter]: For program point $Ultimate##9(lines 329 357) no Hoare annotation was computed. [2018-11-10 01:50:42,636 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 360) no Hoare annotation was computed. [2018-11-10 01:50:42,636 INFO L421 ceAbstractionStarter]: At program point L317(lines 316 361) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2018-11-10 01:50:42,636 INFO L425 ceAbstractionStarter]: For program point L342(line 342) no Hoare annotation was computed. [2018-11-10 01:50:42,636 INFO L425 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 311 364) no Hoare annotation was computed. [2018-11-10 01:50:42,636 INFO L421 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 311 364) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,643 INFO L425 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-10 01:50:42,644 INFO L421 ceAbstractionStarter]: At program point L328(lines 327 358) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,644 INFO L421 ceAbstractionStarter]: At program point L326(lines 325 358) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,644 INFO L425 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 311 364) no Hoare annotation was computed. [2018-11-10 01:50:42,644 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 359) no Hoare annotation was computed. [2018-11-10 01:50:42,644 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 01:50:42,644 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-10 01:50:42,644 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 01:50:42,644 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 01:50:42,644 INFO L421 ceAbstractionStarter]: At program point L1225(line 1225) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse11 (+ CdAudio435DeviceControl_~status~6 1073741670)) (.cse10 (+ CdAudio435DeviceControl_~__cil_tmp104~1 1073741670))) (and (<= 0 .cse10) (<= .cse11 0) (<= 0 .cse11) (<= .cse10 0) (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)))))) [2018-11-10 01:50:42,650 INFO L425 ceAbstractionStarter]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2018-11-10 01:50:42,650 INFO L421 ceAbstractionStarter]: At program point L1060(lines 1059 1474) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-10 01:50:42,650 INFO L425 ceAbstractionStarter]: For program point L1341(lines 1341 1343) no Hoare annotation was computed. [2018-11-10 01:50:42,651 INFO L421 ceAbstractionStarter]: At program point L1275(line 1275) the Hoare annotation is: (or (let ((.cse0 (+ CdAudio435DeviceControl_~__cil_tmp106~1 1073741670))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= .cse0 0) (<= 0 .cse0) (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0))) (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-11-10 01:50:42,651 INFO L425 ceAbstractionStarter]: For program point L1341-2(lines 1341 1343) no Hoare annotation was computed. [2018-11-10 01:50:42,651 INFO L425 ceAbstractionStarter]: For program point L1275-1(line 1275) no Hoare annotation was computed. [2018-11-10 01:50:42,651 INFO L421 ceAbstractionStarter]: At program point L1143(line 1143) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,656 INFO L425 ceAbstractionStarter]: For program point L1143-1(line 1143) no Hoare annotation was computed. [2018-11-10 01:50:42,656 INFO L425 ceAbstractionStarter]: For program point L1077(lines 1077 1470) no Hoare annotation was computed. [2018-11-10 01:50:42,656 INFO L425 ceAbstractionStarter]: For program point L1160(lines 1160 1172) no Hoare annotation was computed. [2018-11-10 01:50:42,657 INFO L425 ceAbstractionStarter]: For program point L1127(lines 1127 1131) no Hoare annotation was computed. [2018-11-10 01:50:42,657 INFO L421 ceAbstractionStarter]: At program point L1309(line 1309) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse10 (+ CdAudio435DeviceControl_~status~6 1073741670)) (.cse11 (+ CdAudio435DeviceControl_~__cil_tmp109~1 1073741670))) (and (<= .cse10 0) (<= .cse11 0) (<= 0 .cse10) (<= 0 .cse11) (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)))))) [2018-11-10 01:50:42,657 INFO L425 ceAbstractionStarter]: For program point L1309-1(line 1309) no Hoare annotation was computed. [2018-11-10 01:50:42,657 INFO L425 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 893 1498) no Hoare annotation was computed. [2018-11-10 01:50:42,657 INFO L421 ceAbstractionStarter]: At program point L1078(lines 1077 1470) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-10 01:50:42,657 INFO L425 ceAbstractionStarter]: For program point L1095(lines 1095 1466) no Hoare annotation was computed. [2018-11-10 01:50:42,657 INFO L421 ceAbstractionStarter]: At program point L1442(line 1442) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 CdAudio435DeviceControl_~status~6) (and (= ~s~0 ~NP~0) (= 0 ~pended~0)))) [2018-11-10 01:50:42,665 INFO L425 ceAbstractionStarter]: For program point L1442-1(line 1442) no Hoare annotation was computed. [2018-11-10 01:50:42,665 INFO L425 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 893 1498) no Hoare annotation was computed. [2018-11-10 01:50:42,665 INFO L421 ceAbstractionStarter]: At program point L1393(line 1393) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,665 INFO L425 ceAbstractionStarter]: For program point L1393-1(line 1393) no Hoare annotation was computed. [2018-11-10 01:50:42,665 INFO L425 ceAbstractionStarter]: For program point L1245(lines 1245 1248) no Hoare annotation was computed. [2018-11-10 01:50:42,666 INFO L425 ceAbstractionStarter]: For program point L1113(lines 1113 1462) no Hoare annotation was computed. [2018-11-10 01:50:42,666 INFO L425 ceAbstractionStarter]: For program point L1014(lines 1014 1484) no Hoare annotation was computed. [2018-11-10 01:50:42,666 INFO L421 ceAbstractionStarter]: At program point L1460(lines 1117 1461) the Hoare annotation is: (let ((.cse13 (+ ~NP~0 2)) (.cse12 (+ ~NP~0 5)) (.cse11 (+ ~SKIP1~0 2))) (let ((.cse0 (and (<= .cse13 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse12 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse11 ~MPR1~0)))) (or (and .cse0 (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0)) (let ((.cse1 (< ~SKIP1~0 .cse13)) (.cse2 (< ~MPR3~0 .cse12)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse11)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (= 0 CdAudio435DeviceControl_~status~6) .cse0)))) [2018-11-10 01:50:42,666 INFO L425 ceAbstractionStarter]: For program point L1163(lines 1163 1165) no Hoare annotation was computed. [2018-11-10 01:50:42,666 INFO L425 ceAbstractionStarter]: For program point L1163-2(lines 1163 1165) no Hoare annotation was computed. [2018-11-10 01:50:42,666 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)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,672 INFO L425 ceAbstractionStarter]: For program point L1378-1(line 1378) no Hoare annotation was computed. [2018-11-10 01:50:42,672 INFO L425 ceAbstractionStarter]: For program point L1279(lines 1279 1292) no Hoare annotation was computed. [2018-11-10 01:50:42,673 INFO L421 ceAbstractionStarter]: At program point L1114(lines 1113 1462) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~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-10 01:50:42,673 INFO L421 ceAbstractionStarter]: At program point L1015(lines 1014 1484) 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,673 INFO L421 ceAbstractionStarter]: At program point L1494(line 1494) the Hoare annotation is: (let ((.cse12 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 2)) (.cse13 (+ ~NP~0 5)) (.cse11 (+ ~SKIP1~0 2))) (let ((.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) (<= .cse12 ~SKIP2~0) (and (<= .cse14 ~SKIP1~0) (= ~s~0 ~NP~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse13 ~MPR3~0) (= 0 ~compRegistered~0) (<= .cse11 ~MPR1~0))))) (or (and (= 0 CdAudio435DeviceControl_~status~6) .cse0) (let ((.cse1 (< ~SKIP1~0 .cse14)) (.cse2 (< ~MPR3~0 .cse13)) (.cse4 (< ~SKIP2~0 .cse12)) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse11)) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or .cse1 .cse2 (< 0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse3 0) .cse9 .cse10)) (or .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) .cse0)))) [2018-11-10 01:50:42,673 INFO L425 ceAbstractionStarter]: For program point L1494-1(line 1494) no Hoare annotation was computed. [2018-11-10 01:50:42,673 INFO L425 ceAbstractionStarter]: For program point L1428(line 1428) no Hoare annotation was computed. [2018-11-10 01:50:42,684 INFO L421 ceAbstractionStarter]: At program point L1329(line 1329) 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 (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-10 01:50:42,684 INFO L421 ceAbstractionStarter]: At program point L1296(lines 1296 1297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,684 INFO L425 ceAbstractionStarter]: For program point L1329-1(line 1329) no Hoare annotation was computed. [2018-11-10 01:50:42,684 INFO L425 ceAbstractionStarter]: For program point L1296-1(lines 1296 1297) no Hoare annotation was computed. [2018-11-10 01:50:42,684 INFO L425 ceAbstractionStarter]: For program point L1230(lines 1230 1233) no Hoare annotation was computed. [2018-11-10 01:50:42,684 INFO L425 ceAbstractionStarter]: For program point L1032(lines 1032 1480) no Hoare annotation was computed. [2018-11-10 01:50:42,684 INFO L425 ceAbstractionStarter]: For program point L1132(lines 1132 1146) no Hoare annotation was computed. [2018-11-10 01:50:42,684 INFO L421 ceAbstractionStarter]: At program point L1033(lines 1023 1482) the Hoare annotation is: (or (and (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (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)|)) (= 0 ~myStatus~0)) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 ~routine~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse4 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse4 0) .cse10 .cse11)) (or .cse2 .cse3 (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-11-10 01:50:42,684 INFO L421 ceAbstractionStarter]: At program point L1347(line 1347) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= (+ CdAudio435DeviceControl_~status~6 1073741789) 0)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,693 INFO L425 ceAbstractionStarter]: For program point L1347-1(line 1347) no Hoare annotation was computed. [2018-11-10 01:50:42,693 INFO L425 ceAbstractionStarter]: For program point L1182-1(lines 1182 1186) no Hoare annotation was computed. [2018-11-10 01:50:42,693 INFO L421 ceAbstractionStarter]: At program point L1116(lines 1115 1462) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-10 01:50:42,693 INFO L425 ceAbstractionStarter]: For program point L1050(lines 1050 1476) no Hoare annotation was computed. [2018-11-10 01:50:42,693 INFO L425 ceAbstractionStarter]: For program point L1430(lines 1430 1451) no Hoare annotation was computed. [2018-11-10 01:50:42,693 INFO L425 ceAbstractionStarter]: For program point L1265(lines 1265 1278) no Hoare annotation was computed. [2018-11-10 01:50:42,693 INFO L425 ceAbstractionStarter]: For program point L1216(lines 1216 1228) no Hoare annotation was computed. [2018-11-10 01:50:42,693 INFO L421 ceAbstractionStarter]: At program point L1150(lines 1150 1151) 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,693 INFO L425 ceAbstractionStarter]: For program point L1150-1(lines 1150 1151) no Hoare annotation was computed. [2018-11-10 01:50:42,693 INFO L421 ceAbstractionStarter]: At program point L1051(lines 1050 1476) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,704 INFO L425 ceAbstractionStarter]: For program point L1068(lines 1068 1472) no Hoare annotation was computed. [2018-11-10 01:50:42,704 INFO L421 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: (or (and (= ~myStatus~0 |old(~myStatus~0)|) (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)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,704 INFO L425 ceAbstractionStarter]: For program point L1448-1(line 1448) no Hoare annotation was computed. [2018-11-10 01:50:42,704 INFO L425 ceAbstractionStarter]: For program point L1382(lines 1382 1396) no Hoare annotation was computed. [2018-11-10 01:50:42,704 INFO L425 ceAbstractionStarter]: For program point L1283(lines 1283 1285) no Hoare annotation was computed. [2018-11-10 01:50:42,704 INFO L425 ceAbstractionStarter]: For program point L1283-2(lines 1283 1285) no Hoare annotation was computed. [2018-11-10 01:50:42,704 INFO L425 ceAbstractionStarter]: For program point L1300(lines 1300 1312) no Hoare annotation was computed. [2018-11-10 01:50:42,704 INFO L425 ceAbstractionStarter]: For program point $Ultimate##26(lines 1117 1461) no Hoare annotation was computed. [2018-11-10 01:50:42,704 INFO L421 ceAbstractionStarter]: At program point L1069(lines 1068 1472) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-10 01:50:42,704 INFO L425 ceAbstractionStarter]: For program point $Ultimate##25(lines 1117 1461) no Hoare annotation was computed. [2018-11-10 01:50:42,704 INFO L421 ceAbstractionStarter]: At program point L1317(line 1317) 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 (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse9 0) .cse7 .cse8)))) [2018-11-10 01:50:42,708 INFO L425 ceAbstractionStarter]: For program point L1317-1(line 1317) no Hoare annotation was computed. [2018-11-10 01:50:42,708 INFO L425 ceAbstractionStarter]: For program point L1086(lines 1086 1468) no Hoare annotation was computed. [2018-11-10 01:50:42,709 INFO L421 ceAbstractionStarter]: At program point L1400(lines 1400 1401) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-10 01:50:42,709 INFO L425 ceAbstractionStarter]: For program point L1367(lines 1367 1381) no Hoare annotation was computed. [2018-11-10 01:50:42,709 INFO L425 ceAbstractionStarter]: For program point L1400-1(lines 1400 1401) no Hoare annotation was computed. [2018-11-10 01:50:42,709 INFO L421 ceAbstractionStarter]: At program point L1169(line 1169) the Hoare annotation is: (or (and (<= (+ CdAudio435DeviceControl_~status~6 1073741670) 0) (and (= ~s~0 ~NP~0) (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,709 INFO L425 ceAbstractionStarter]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2018-11-10 01:50:42,709 INFO L421 ceAbstractionStarter]: At program point L1417(line 1417) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-10 01:50:42,709 INFO L425 ceAbstractionStarter]: For program point L1417-1(line 1417) no Hoare annotation was computed. [2018-11-10 01:50:42,715 INFO L421 ceAbstractionStarter]: At program point L1252(line 1252) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,715 INFO L425 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-11-10 01:50:42,715 INFO L425 ceAbstractionStarter]: For program point L1252-1(line 1252) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1219-2(lines 1219 1221) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L421 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 893 1498) the Hoare annotation is: (or (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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1269(lines 1269 1271) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1269-2(lines 1269 1271) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1137(lines 1137 1139) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1104(lines 1104 1464) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1137-2(lines 1137 1139) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1154(lines 1154 1180) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1154-1(lines 1117 1459) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L425 ceAbstractionStarter]: For program point L1303(lines 1303 1305) no Hoare annotation was computed. [2018-11-10 01:50:42,716 INFO L421 ceAbstractionStarter]: At program point L1237(line 1237) the Hoare annotation is: (let ((.cse12 (+ ~NP~0 2)) (.cse11 (+ ~NP~0 5)) (.cse10 (+ ~SKIP1~0 2))) (or (let ((.cse0 (< ~SKIP1~0 .cse12)) (.cse1 (< ~MPR3~0 .cse11)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 .cse10)) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~myStatus~0) (let ((.cse13 (+ CdAudio435DeviceControl_~status~6 1073741670))) (and (<= 0 .cse13) (let ((.cse14 (<= .cse13 0)) (.cse15 (and (<= .cse12 ~SKIP1~0) (= 0 ~pended~0) (= ~routine~0 0) (<= .cse11 ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse10 ~MPR1~0))) (.cse16 (not (= CdAudio435DeviceControl_~__cil_tmp103~1 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (or (and .cse14 .cse15 .cse16 (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))) (and .cse14 (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) .cse15 .cse16))) (= ~myStatus~0 |old(~myStatus~0)|)))))) [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1303-2(lines 1303 1305) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L421 ceAbstractionStarter]: At program point L1105(lines 1086 1468) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1320(lines 1320 1332) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1254(lines 1254 1261) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1023(lines 1023 1482) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1436(lines 1436 1438) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1403(lines 1403 1410) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1436-2(lines 1436 1438) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L425 ceAbstractionStarter]: For program point L1337(lines 1337 1350) no Hoare annotation was computed. [2018-11-10 01:50:42,723 INFO L421 ceAbstractionStarter]: At program point L1205(line 1205) the Hoare annotation is: (or (and (and (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (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)|)) (= 0 ~myStatus~0)) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 ~routine~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= 0 |old(~pended~0)|)))) (and (let ((.cse4 (+ |old(~myStatus~0)| 1073741637))) (or .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse4 0) .cse10 .cse11)) (or .cse2 .cse3 (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2018-11-10 01:50:42,725 INFO L425 ceAbstractionStarter]: For program point L1205-1(line 1205) no Hoare annotation was computed. [2018-11-10 01:50:42,725 INFO L425 ceAbstractionStarter]: For program point L1387(lines 1387 1389) no Hoare annotation was computed. [2018-11-10 01:50:42,726 INFO L421 ceAbstractionStarter]: At program point L1354(line 1354) the Hoare annotation is: (or (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1))))) [2018-11-10 01:50:42,726 INFO L425 ceAbstractionStarter]: For program point L1354-1(line 1354) no Hoare annotation was computed. [2018-11-10 01:50:42,726 INFO L425 ceAbstractionStarter]: For program point L1387-2(lines 1387 1389) no Hoare annotation was computed. [2018-11-10 01:50:42,726 INFO L425 ceAbstractionStarter]: For program point L1404(lines 1404 1406) no Hoare annotation was computed. [2018-11-10 01:50:42,726 INFO L425 ceAbstractionStarter]: For program point L1404-2(lines 1404 1406) no Hoare annotation was computed. [2018-11-10 01:50:42,726 INFO L425 ceAbstractionStarter]: For program point L1239(lines 1239 1241) no Hoare annotation was computed. [2018-11-10 01:50:42,726 INFO L425 ceAbstractionStarter]: For program point L1041(lines 1041 1478) no Hoare annotation was computed. [2018-11-10 01:50:42,726 INFO L421 ceAbstractionStarter]: At program point L1289(line 1289) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (= 0 CdAudio435DeviceControl_~status~6)) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,726 INFO L425 ceAbstractionStarter]: For program point L1289-1(line 1289) no Hoare annotation was computed. [2018-11-10 01:50:42,726 INFO L425 ceAbstractionStarter]: For program point L1190(lines 1190 1194) no Hoare annotation was computed. [2018-11-10 01:50:42,731 INFO L425 ceAbstractionStarter]: For program point L1157(lines 1157 1176) no Hoare annotation was computed. [2018-11-10 01:50:42,731 INFO L425 ceAbstractionStarter]: For program point L1190-2(lines 1117 1459) no Hoare annotation was computed. [2018-11-10 01:50:42,731 INFO L425 ceAbstractionStarter]: For program point L1372(lines 1372 1374) no Hoare annotation was computed. [2018-11-10 01:50:42,731 INFO L425 ceAbstractionStarter]: For program point L1372-2(lines 1372 1374) no Hoare annotation was computed. [2018-11-10 01:50:42,731 INFO L425 ceAbstractionStarter]: For program point L1207(lines 1207 1209) no Hoare annotation was computed. [2018-11-10 01:50:42,731 INFO L425 ceAbstractionStarter]: For program point L1207-2(lines 1207 1209) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L421 ceAbstractionStarter]: At program point L1042(lines 1041 1478) the Hoare annotation is: (or (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (<= 147480 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1) (not (= CdAudio435DeviceControl_~__cil_tmp42~0 CdAudio435DeviceControl_~currentIrpStack__Parameters__DeviceIoControl__IoControlCode~1)))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1488(lines 1488 1490) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1488-2(lines 1488 1490) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1356(lines 1356 1359) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1323(lines 1323 1325) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1257(lines 1257 1259) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1323-2(lines 1323 1325) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L421 ceAbstractionStarter]: At program point L1125(line 1125) 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))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.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)|)))) (and (let ((.cse2 (+ |old(~myStatus~0)| 1073741637))) (or .cse0 .cse1 (< 0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse2 0) .cse8 .cse9)) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point L1059(lines 1059 1474) no Hoare annotation was computed. [2018-11-10 01:50:42,732 INFO L428 ceAbstractionStarter]: At program point CdAudioUnloadENTRY(lines 1673 1679) the Hoare annotation is: true [2018-11-10 01:50:42,732 INFO L425 ceAbstractionStarter]: For program point CdAudioUnloadEXIT(lines 1673 1679) no Hoare annotation was computed. [2018-11-10 01:50:42,744 INFO L425 ceAbstractionStarter]: For program point CdAudioUnloadFINAL(lines 1673 1679) no Hoare annotation was computed. [2018-11-10 01:50:42,744 INFO L425 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-11-10 01:50:42,744 INFO L425 ceAbstractionStarter]: For program point L1664(lines 1664 1669) no Hoare annotation was computed. [2018-11-10 01:50:42,744 INFO L425 ceAbstractionStarter]: For program point L1664-2(lines 1664 1669) no Hoare annotation was computed. [2018-11-10 01:50:42,744 INFO L421 ceAbstractionStarter]: At program point L1652(line 1652) the Hoare annotation is: (let ((.cse8 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse8))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 (< .cse8 0) .cse9 .cse10) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))))) (and (or .cse0 .cse1) (or .cse0 (not (= |old(~customIrp~0)| 0))))))) [2018-11-10 01:50:42,744 INFO L425 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2018-11-10 01:50:42,744 INFO L425 ceAbstractionStarter]: For program point L1650-1(lines 1645 1658) no Hoare annotation was computed. [2018-11-10 01:50:42,744 INFO L425 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1638 1672) no Hoare annotation was computed. [2018-11-10 01:50:42,744 INFO L421 ceAbstractionStarter]: At program point L1661(line 1661) the Hoare annotation is: (let ((.cse12 (+ ~myStatus~0 1073741637))) (let ((.cse5 (< 0 .cse12))) (let ((.cse4 (let ((.cse6 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse13 (not (= 0 |old(~pended~0)|))) (.cse14 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (or .cse6 .cse7 .cse5 .cse8 .cse9 .cse10 .cse11 (< .cse12 0) .cse13 .cse14) (or .cse6 .cse7 (not (= ~myStatus~0 0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))))) (let ((.cse0 (or .cse4 (not (= |old(~customIrp~0)| 0)))) (.cse1 (= 0 ~pended~0)) (.cse2 (<= 1 ~compRegistered~0)) (.cse3 (= ~routine~0 1))) (and (or .cse0 (and .cse1 (= ~s~0 |old(~s~0)|) .cse2 .cse3)) (or .cse0 (= |old(~customIrp~0)| ~customIrp~0)) (or .cse4 .cse5 (and .cse1 (= |old(~s~0)| ~s~0) .cse2 .cse3))))))) [2018-11-10 01:50:42,744 INFO L425 ceAbstractionStarter]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2018-11-10 01:50:42,745 INFO L421 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1638 1672) the Hoare annotation is: (let ((.cse9 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse9))) (let ((.cse0 (let ((.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (or .cse3 .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 (< .cse9 0) .cse10 .cse11) (or .cse3 .cse4 (not (= ~myStatus~0 0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11)))) (.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (= ~routine~0 0)))) (and (or .cse0 .cse1 .cse2) (or .cse0 (and .cse2 (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~customIrp~0)| 0))))))) [2018-11-10 01:50:42,745 INFO L421 ceAbstractionStarter]: At program point L1647(line 1647) the Hoare annotation is: (let ((.cse8 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse8))) (let ((.cse0 (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (or .cse2 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 (< .cse8 0) .cse9 .cse10) (or .cse2 .cse3 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))))) (and (or .cse0 .cse1) (or .cse0 (not (= |old(~customIrp~0)| 0))))))) [2018-11-10 01:50:42,755 INFO L425 ceAbstractionStarter]: For program point L1645(lines 1645 1658) no Hoare annotation was computed. [2018-11-10 01:50:42,755 INFO L425 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 1638 1672) no Hoare annotation was computed. [2018-11-10 01:50:42,755 INFO L421 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse11 (+ ~myStatus~0 1073741637))) (let ((.cse1 (< 0 .cse11)) (.cse14 (<= 259 CdAudioForwardIrpSynchronous_~status~8)) (.cse15 (= 0 ~pended~0)) (.cse16 (<= 1 ~compRegistered~0)) (.cse18 (= ~routine~0 1)) (.cse17 (= 1 ~setEventCalled~0))) (let ((.cse3 (and (= ~s~0 ~MPR3~0) (and .cse14 .cse15 .cse16 .cse18 .cse17))) (.cse2 (and .cse14 .cse15 (= |old(~s~0)| ~s~0) .cse16 .cse17 .cse18)) (.cse0 (let ((.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (not (= 0 |old(~routine~0)|))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~SKIP2~0 3))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (or (not (= |old(~s~0)| ~NP~0)) (not (= |old(~compRegistered~0)| 0))))) (and (or .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 (< .cse11 0) .cse12 .cse13) (or .cse5 .cse6 (not (= ~myStatus~0 0)) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13)))) (.cse4 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse3 .cse2 .cse4) (or (or .cse0 .cse4) (= |old(~customIrp~0)| ~customIrp~0)))))) [2018-11-10 01:50:42,755 INFO L428 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 2127 2147) the Hoare annotation is: true [2018-11-10 01:50:42,755 INFO L428 ceAbstractionStarter]: At program point L2136(lines 2135 2145) the Hoare annotation is: true [2018-11-10 01:50:42,755 INFO L428 ceAbstractionStarter]: At program point L2134(lines 2133 2145) the Hoare annotation is: true [2018-11-10 01:50:42,755 INFO L425 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 2127 2147) no Hoare annotation was computed. [2018-11-10 01:50:42,755 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 2137 2144) no Hoare annotation was computed. [2018-11-10 01:50:42,755 INFO L425 ceAbstractionStarter]: For program point L2133(lines 2133 2145) no Hoare annotation was computed. [2018-11-10 01:50:42,756 INFO L425 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 2127 2147) no Hoare annotation was computed. [2018-11-10 01:50:42,756 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 2137 2144) no Hoare annotation was computed. [2018-11-10 01:50:42,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:50:42 BoogieIcfgContainer [2018-11-10 01:50:42,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:50:42,840 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:50:42,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:50:42,840 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:50:42,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:49:51" (3/4) ... [2018-11-10 01:50:42,844 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 01:50:42,851 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-11-10 01:50:42,852 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-11-10 01:50:42,853 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-11-10 01:50:42,854 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-11-10 01:50:42,854 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2018-11-10 01:50:42,854 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-11-10 01:50:42,854 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-10 01:50:42,875 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2018-11-10 01:50:42,877 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-10 01:50:42,879 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 01:50:42,918 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == status && NP + 5 <= MPR3 && 0 == pended) && SKIP2 == s) && lowerDriverReturn == status) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (!(259 == status) && ((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2)) || !(0 == \old(pended))) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s)) || (((0 == status && NP + 5 <= MPR3 && 0 == pended) && lowerDriverReturn == status) && IPC == s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-10 01:50:42,918 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))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (!(259 == status) && ((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-10 01:50:42,918 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))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (!(259 == status) && (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)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-10 01:50:42,919 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-11-10 01:50:42,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1)) || !(\old(customIrp) == 0)) || (\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled)) && (((!(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) || (s == NP && \old(customIrp) == customIrp))) && (\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)) || !(\old(customIrp) == 0))) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) [2018-11-10 01:50:42,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1)) || !(\old(customIrp) == 0)) || (\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled)) && (((!(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) || (s == NP && \old(customIrp) == customIrp))) && (\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)) || !(\old(customIrp) == 0))) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) [2018-11-10 01:50:42,920 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-10 01:50:42,921 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) || !(\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) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0)) || !(\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-10 01:50:42,921 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-10 01:50:42,921 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-11-10 01:50:42,921 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(\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)) || !(\old(compRegistered) == 0)) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\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-10 01:50:42,921 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((lowerDriverReturn == status && routine == 0) && 1 <= compRegistered) && IPC == s) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s) [2018-11-10 01:50:42,922 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)) || !(\old(customIrp) == 0)) && ((!(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0))) && (((1 == setEventCalled && s == \old(s)) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1)) || !(\old(customIrp) == 0))) && (\old(s) == s || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) [2018-11-10 01:50:42,922 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-10 01:50:42,922 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-10 01:50:42,923 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) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0)) && \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-10 01:50:42,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-11-10 01:50:42,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) [2018-11-10 01:50:42,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) [2018-11-10 01:50:42,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || !(\old(customIrp) == 0)) || ((setPagable <= 0 && (((s == NP && 0 == pended) && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) [2018-11-10 01:50:42,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) [2018-11-10 01:50:42,924 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-10 01:50:42,924 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,927 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) [2018-11-10 01:50:42,927 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-10 01:50:42,927 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) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(\old(customIrp) == 0)) && (0 < myStatus + 1073741637 || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) [2018-11-10 01:50:42,927 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || (((SKIP2 + 3 <= IPC && DC + 2 <= SKIP2) && status + 1073741670 <= 0) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1)) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || (((SKIP2 + 3 <= IPC && DC + 2 <= SKIP2) && status + 1073741670 <= 0) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1)) [2018-11-10 01:50:42,927 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))))) || (0 == status && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) [2018-11-10 01:50:42,927 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-10 01:50:42,927 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || ((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) && (0 < myStatus + 1073741637 || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) [2018-11-10 01:50:42,928 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (((0 <= status + 1073741670 && myStatus == \old(myStatus)) && status + 1073741670 <= 0) && ((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (((0 <= status + 1073741670 && myStatus == \old(myStatus)) && status + 1073741670 <= 0) && ((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,930 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || !(\old(customIrp) == 0)) || (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) && myStatus + 1073741637 <= 0) [2018-11-10 01:50:42,931 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || !(\old(customIrp) == 0)) || (((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) [2018-11-10 01:50:42,931 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) [2018-11-10 01:50:42,938 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-10 01:50:42,938 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) && 0 == myStatus) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-10 01:50:42,938 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-10 01:50:42,938 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,938 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) [2018-11-10 01:50:42,942 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((0 == pended && \old(s) == s) && myStatus == \old(myStatus))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((0 == pended && \old(s) == s) && myStatus == \old(myStatus))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,942 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-10 01:50:42,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-10 01:50:42,943 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,955 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-10 01:50:42,956 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,956 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (0 == pended && \old(s) == s) [2018-11-10 01:50:42,956 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,956 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(s) == s)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(s) == s)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:42,973 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) [2018-11-10 01:50:42,973 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) [2018-11-10 01:50:42,973 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) [2018-11-10 01:50:43,148 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1e18e75d-8cde-4a8f-b596-b7a1c4e1fee1/bin-2019/uautomizer/witness.graphml [2018-11-10 01:50:43,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:50:43,149 INFO L168 Benchmark]: Toolchain (without parser) took 53310.31 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 951.1 MB in the beginning and 1.7 GB in the end (delta: -735.1 MB). Peak memory consumption was 483.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:43,150 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:50:43,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.61 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 908.1 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:43,150 INFO L168 Benchmark]: Boogie Preprocessor took 116.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 908.1 MB in the beginning and 1.2 GB in the end (delta: -247.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:43,150 INFO L168 Benchmark]: RCFGBuilder took 983.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 154.7 MB). Peak memory consumption was 154.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:43,151 INFO L168 Benchmark]: TraceAbstraction took 51507.59 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -712.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-10 01:50:43,151 INFO L168 Benchmark]: Witness Printer took 308.40 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:43,152 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.61 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 908.1 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 908.1 MB in the beginning and 1.2 GB in the end (delta: -247.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 983.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 154.7 MB). Peak memory consumption was 154.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51507.59 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -712.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 308.40 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: (((((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((((NP + 2 <= SKIP1 && routine == 0) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || ((((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && 0 == pended && NP + 5 <= MPR3) && !(259 == status))) || !(\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)) || !(\old(compRegistered) == 0)) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || (((0 == status && lowerDriverReturn == status) && IPC == s) && 0 == pended && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\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) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - 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) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) || (((SKIP2 + 3 <= IPC && DC + 2 <= SKIP2) && status + 1073741670 <= 0) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1)) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) || (((SKIP2 + 3 <= IPC && DC + 2 <= SKIP2) && status + 1073741670 <= 0) && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1)) - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (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) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (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)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && routine == 0) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && 1 <= compRegistered) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (!(259 == status) && ((DC == s && (NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP1 + 2 <= MPR1) && DC + 5 <= IPC) && DC + 2 <= SKIP2)) || !(0 == \old(pended))) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3 && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && IPC == s)) || (((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: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 2029]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1)) || !(\old(customIrp) == 0)) || (\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled)) && (((!(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) || (s == NP && \old(customIrp) == customIrp))) && (\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)) || !(\old(customIrp) == 0))) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) - InvariantResult [Line: 1927]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - 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: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || ((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) && (0 < myStatus + 1073741637 || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(s) == s)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \old(s) == s)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((0 == pended && s == NP) && 1 <= compRegistered) && routine == 1) && \old(customIrp) == customIrp) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || !(\old(customIrp) == 0)) && (0 < myStatus + 1073741637 || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 2027]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1)) || !(\old(customIrp) == 0)) || (\old(customIrp) == customIrp && \old(s) == s && 1 == setEventCalled)) && (((!(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0)) || (s == NP && \old(customIrp) == customIrp))) && (\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)) || !(\old(customIrp) == 0))) && (s == NP || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status + 1073741670 <= 0) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))))) || (0 == status && (((((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && routine == 0) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) - 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) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) || ((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0)) && \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) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (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) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (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) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || !(\old(customIrp) == 0)) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: (((\old(customIrp) == customIrp || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2)) || !(\old(customIrp) == 0)) && ((!(\old(s) == MPR3) || (((0 < myStatus + 1073741637 || myStatus + 1073741637 < 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)) && (!(myStatus == 0) || ((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || SKIP2 < DC + 2) || ((MPR3 < NP + 5 || !(0 == pended)) || compRegistered < 1) || !(1 == routine)))) || !(\old(customIrp) == 0))) && (((1 == setEventCalled && s == \old(s)) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) || compRegistered < 1) && ((((((((((!(\old(setEventCalled) == 1) || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || MPR3 < NP + 5) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == pended)) || compRegistered < 1)) || !(\old(customIrp) == 0))) && (\old(s) == s || (((((((((SKIP1 < NP + 2 || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == pended)) && (((((((SKIP1 < NP + 2 || (MPR3 < NP + 5 || !(\old(s) == NP)) || !(compRegistered == 0)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(myStatus == 0)) || !(0 == pended)) || SKIP2 < DC + 2))) - 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))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((0 == status && NP + 5 <= MPR3) && lowerDriverReturn == status)) || !(\old(s) == \old(NP))) || (!(259 == status) && (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)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1932]: Loop Invariant Derived loop invariant: ((((0 == pended && s == SKIP1) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(myStatus == 0)) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < myStatus + 1073741637) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == \old(pended))))) && ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1)) && (((((((compRetStatus + 1073741802 <= 0 && 0 == pended) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp8 + 1073741802 <= 0) && 1 == setEventCalled) && 0 <= __cil_tmp8 + 1073741802) || ((((((((((MPR3 < NP + 5 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(0 == \old(pended))) || compRegistered < 1) && ((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || !(1 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1)) || !(customIrp == 0))) && (((((((((((MPR3 < NP + 5 || 0 < myStatus + 1073741637) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || (((NP + 5 <= MPR3 && DC + 2 <= SKIP2) && \old(s) == s) && s + 2 <= SKIP1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || myStatus + 1073741637 < 0) || !(0 == \old(pended))) || compRegistered < 1) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((0 == pended && \old(s) == s) && myStatus == \old(myStatus))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((0 == pended && \old(s) == s) && myStatus == \old(myStatus))) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 1050]: Loop Invariant Derived loop invariant: ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((lowerDriverReturn == status && routine == 0) && 1 <= compRegistered) && IPC == s) || ((status <= lowerDriverReturn && ((0 == pended && NP + 5 <= MPR3) && routine == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || ((!(259 == status) && DC == s) && (0 == pended && NP + 5 <= MPR3) && routine == 0)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))))) || ((((0 == pended && NP + 5 <= MPR3) && lowerDriverReturn == status) && routine == 0) && IPC == s) - InvariantResult [Line: 1068]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || ((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || !(\old(customIrp) == 0)) || (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (((((0 == pended && \old(s) == s) && !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) || ((0 == pended && \old(s) == s) && 147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode)) && myStatus == \old(myStatus)) && 0 == myStatus) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - 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) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) || !(\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) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= myStatus + 1073741637) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0)) || !(\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) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) || (((0 == pended && \old(s) == s) && (147480 <= currentIrpStack__Parameters__DeviceIoControl__IoControlCode || !(__cil_tmp42 == currentIrpStack__Parameters__DeviceIoControl__IoControlCode))) && myStatus == \old(myStatus)) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (((0 <= status + 1073741670 && myStatus == \old(myStatus)) && status + 1073741670 <= 0) && ((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (((0 <= status + 1073741670 && myStatus == \old(myStatus)) && status + 1073741670 <= 0) && ((NP + 2 <= SKIP1 && s == NP) && 0 == pended) && NP + 5 <= MPR3)) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && myStatus == \old(myStatus)) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: (0 == pended && \old(s) == s) || (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended)))) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || !(\old(customIrp) == 0)) || ((setPagable <= 0 && (((s == NP && 0 == pended) && 0 == compRegistered) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) - 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))) || (((0 == status && SKIP2 == s) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || UNLOADED == s) || ((((((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((NP + 2 <= SKIP1 && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP + 5 <= MPR3)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (!(259 == status) && ((DC == s && DC + 5 <= IPC) && DC + 2 <= SKIP2) && (NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || !(\old(customIrp) == 0)) || (((((0 == pended && 0 == compRegistered) && s == \old(s)) && routine == 0) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((((0 == pended && 0 == compRegistered) && \old(s) == s) && routine == 0) && 0 == myStatus) && myStatus == \old(myStatus)) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(compRegistered == 0)) || !(0 == \old(pended))) && (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || ((((NP + 2 <= SKIP1 && 0 == pended) && \old(s) == s) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(compRegistered == 0)) || !(0 == \old(pended))) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || \old(myStatus) + 1073741637 < 0) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(\old(myStatus) == 0)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || IPC < SKIP2 + 3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended)))) || (((0 == pended && routine == 0) && 0 == compRegistered) && \old(s) == s) - 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, 51.3s OverallTime, 94 OverallIterations, 2 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 23.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 49466 SDtfs, 18779 SDslu, 224501 SDs, 0 SdLazy, 22499 SolverSat, 3204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 327 SyntacticMatches, 8 SemanticMatches, 743 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=989occurred in iteration=75, 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.3s AutomataMinimizationTime, 94 MinimizatonAttempts, 2520 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 171 LocationsWithAnnotation, 1824 PreInvPairs, 2157 NumberOfFragments, 25393 HoareAnnotationTreeSize, 1824 FomulaSimplifications, 30629992 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 171 FomulaSimplificationsInter, 1968929 FormulaSimplificationTreeSizeReductionInter, 21.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 6326 NumberOfCodeBlocks, 6326 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 6231 ConstructedInterpolants, 0 QuantifiedInterpolants, 876843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 95 InterpolantComputations, 94 PerfectInterpolantSequences, 72/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...